2403 search results - page 256 / 481 » Optimal Randomized RANSAC |
142
click to vote
CORR
2010
Springer
15 years 16 days ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
229
Voted
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
131
click to vote
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
138
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
121
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...