Sciweavers

3533 search results - page 665 / 707
» Locally Optimized RANSAC
Sort
View
106
Voted
MOBIHOC
2008
ACM
15 years 10 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
MOBIHOC
2006
ACM
15 years 10 months ago
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Smart antennas have gained significant importance in multihop wireless networks in recent years, because of their sophisticated signal processing capabilities that hold the potent...
Karthikeyan Sundaresan, Weizhao Wang, Stephan Eide...
STOC
2010
ACM
189views Algorithms» more  STOC 2010»
15 years 8 months ago
Near-optimal extractors against quantum storage
We give near-optimal constructions of extractors secure against quantum bounded-storage adversaries. One instantiation gives the first such extractor to achieve an output length (...
Anindya De and Thomas Vidick
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 8 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
STACS
2010
Springer
15 years 6 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf