Sciweavers

2714 search results - page 486 / 543
» Approximation Schemes for Scheduling
Sort
View
ADHOC
2010
163views more  ADHOC 2010»
15 years 21 days ago
A probabilistic method for cooperative hierarchical aggregation of data in VANETs
We propose an algorithm for the hierarchical aggregation of observations in dissemination-based, distributed traffic information systems. Instead of transmitting observed paramete...
Christian Lochert, Björn Scheuermann, Martin ...
104
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 19 days ago
A stochastic analysis of greedy routing in a spatially-dependent sensor network
For a sensor network, as tractable spatially-dependent node deployment model is presented with the property that the density is inversely proportional to the sink distance. A stoc...
H. Paul Keeler
83
Voted
CORR
2010
Springer
149views Education» more  CORR 2010»
15 years 19 days ago
A probabilistic and RIPless theory of compressed sensing
This paper introduces a simple and very general theory of compressive sensing. In this theory, the sensing mechanism simply selects sensing vectors independently at random from a ...
Emmanuel J. Candès, Yaniv Plan
108
Voted
CORR
2008
Springer
88views Education» more  CORR 2008»
15 years 19 days ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
97
Voted
CVIU
2008
144views more  CVIU 2008»
15 years 19 days ago
Speeded-Up Robust Features (SURF)
This article presents a novel scale- and rotation-invariant detector and descriptor, coined SURF (Speeded-Up Robust Features). SURF approximates or even outperforms previously pro...
Herbert Bay, Andreas Ess, Tinne Tuytelaars, Luc J....