Sciweavers

421 search results - page 70 / 85
» String Distances and Uniformities
Sort
View
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 2 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
14 years 1 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
SIGCOMM
2004
ACM
14 years 1 months ago
Link-level measurements from an 802.11b mesh network
This paper analyzes the causes of packet loss in a 38-node urban multi-hop 802.11b network. The patterns and causes of loss are important in the design of routing and errorcorrect...
Daniel Aguayo, John C. Bicket, Sanjit Biswas, Glen...
SENSYS
2003
ACM
14 years 1 months ago
Cooperative tracking with binary-detection sensor networks
We present a novel method for tracking the movement of people or vehicles in open outdoor environments using sensor networks. Unlike other sensor network-based methods, which depe...
Kirill Mechitov, Sameer Sundresh, YoungMin Kwon, G...
SPIRE
2009
Springer
14 years 1 months ago
Faster Algorithms for Sampling and Counting Biological Sequences
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
Christina Boucher