Sciweavers

5005 search results - page 662 / 1001
» The Design and Analysis of Parallel Algorithms
Sort
View
144
Voted
INFOCOM
2010
IEEE
15 years 5 months ago
On Providing Non-uniform Scheduling Guarantees in a Wireless Network
Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are o...
Vartika Bhandari, Nitin H. Vaidya
DCOSS
2011
Springer
14 years 6 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
PPOPP
2012
ACM
14 years 2 months ago
A speculation-friendly binary search tree
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
Tyler Crain, Vincent Gramoli, Michel Raynal
BMCBI
2008
103views more  BMCBI 2008»
15 years 6 months ago
TOPS++FATCAT: Fast flexible structural alignment using constraints derived from TOPS+ Strings Model
Background: Protein structure analysis and comparison are major challenges in structural bioinformatics. Despite the existence of many tools and algorithms, very few of them have ...
Mallika Veeramalai, Yuzhen Ye, Adam Godzik
SIGMETRICS
2008
ACM
113views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Layered interval codes for tcam-based classification
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
Anat Bremler-Barr, David Hay, Danny Hendler, Boris...