Sciweavers

11211 search results - page 1825 / 2243
» Data Structures
Sort
View
SIGMETRICS
2012
ACM
247views Hardware» more  SIGMETRICS 2012»
13 years 9 months ago
A scalable architecture for maintaining packet latency measurements
Latency has become an important metric for network monitoring since the emergence of new latency-sensitive applications (e.g., algorithmic trading and high-performance computing)....
Myungjin Lee, Nick G. Duffield, Ramana Rao Kompell...
BMCBI
2010
167views more  BMCBI 2010»
15 years 7 months ago
Creating PWMs of transcription factors using 3D structure-based computation of protein-DNA free binding energies
Background: Knowledge of transcription factor-DNA binding patterns is crucial for understanding gene transcription. Numerous DNA-binding proteins are annotated as transcription fa...
Denitsa Alamanova, Philip Stegmaier, Alexander E. ...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
16 years 2 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
CN
2004
148views more  CN 2004»
15 years 6 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
16 years 8 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
« Prev « First page 1825 / 2243 Last » Next »