Sciweavers

12257 search results - page 2358 / 2452
» Analysis of Algorithms
Sort
View
105
Voted
CCS
2009
ACM
15 years 8 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
INFOCOM
2009
IEEE
15 years 8 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...
WABI
2009
Springer
155views Bioinformatics» more  WABI 2009»
15 years 8 months ago
A Markov Classification Model for Metabolic Pathways
Background: This paper considers the problem of identifying pathways through metabolic networks that relate to a specific biological response. Our proposed model, HME3M, first ide...
Timothy Hancock, Hiroshi Mamitsuka
CIKM
2009
Springer
15 years 8 months ago
Vetting the links of the web
Many web links mislead human surfers and automated crawlers because they point to changed content, out-of-date information, or invalid URLs. It is a particular problem for large, ...
Na Dai, Brian D. Davison
COCO
2009
Springer
121views Algorithms» more  COCO 2009»
15 years 8 months ago
Lower Bounds on Quantum Multiparty Communication Complexity
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
Troy Lee, Gideon Schechtman, Adi Shraibman
« Prev « First page 2358 / 2452 Last » Next »