Sciweavers

7930 search results - page 1261 / 1586
» Greedy in Approximation Algorithms
Sort
View
INFOCOM
2012
IEEE
13 years 8 months ago
DEAR: Delay-bounded Energy-constrained Adaptive Routing in wireless sensor networks
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, Cho...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 8 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
CVPR
2009
IEEE
17 years 1 months ago
Global Connectivity Potentials for Random Field Models
Markov random field (MRF, CRF) models are popular in computer vision. However, in order to be computationally tractable they are limited to incorporate only local interactions a...
Sebastian Nowozin, Christoph H. Lampert
ICCV
2009
IEEE
16 years 11 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey
CVPR
2001
IEEE
16 years 8 months ago
Relief Mosaics by Joint View Triangulation
Relief mosaics are collections of registered images that extend traditional mosaics by supporting motion parallax. A simple parallax interpolation algorithm based on computed corr...
Maxime Lhuillier, Long Quan, Harry Shum, Hung-Tat ...
« Prev « First page 1261 / 1586 Last » Next »