Sciweavers

6365 search results - page 799 / 1273
» Fast Local Computation Algorithms
Sort
View
MOBIHOC
2010
ACM
15 years 5 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
MOBIHOC
2010
ACM
15 years 5 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
TOG
2010
106views more  TOG 2010»
15 years 2 months ago
Accelerating spatially varying Gaussian filters
High-dimensional Gaussian filters, most notably the bilateral filter, are important tools for many computer graphics and vision tasks. In recent years, a number of techniques for ...
Jongmin Baek, David E. Jacobs
ICIP
2005
IEEE
16 years 9 months ago
A spatially adaptive Poissonian image deblurring
A spatially adaptive image deblurring algorithm is presented for Poisson observations. It adapts to the unknown image smoothness by using local polynomial approximation (LPA) kern...
Alessandro Foi, Sakari Alenius, Mejdi Trimeche, Vl...
ICML
2009
IEEE
16 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint