2403 search results - page 234 / 481 » Optimal Randomized RANSAC |
134
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—Compressive sensing is a new signal acquisition technology with the potential to reduce the number of measurements required to acquire signals that are sparse or compres...
145
Voted
SP
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of security against timing based traffic analysis in multihop networks is considered in this work. In particular, the relationship between the level of anonymity prov...
127
click to vote
SOFSEM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
126
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
137
click to vote
ISPAN
2005
IEEE
15 years 9 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...