Sciweavers

269 search results - page 42 / 54
» Optimal Randomized Algorithms for Local Sorting and Set-Maxi...
Sort
View
PODC
2009
ACM
14 years 8 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
EVOW
2003
Springer
14 years 21 days ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
WWW
2005
ACM
14 years 8 months ago
A search engine for natural language applications
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search e...
Michael J. Cafarella, Oren Etzioni
ICCV
2001
IEEE
14 years 9 months ago
Euclidean Reconstruction and Auto-Calibration from Continuous Motion
This paper deals with the problem of incorporating natural regularity conditions on the motion in an MAP estimator for structure and motion recovery from uncalibrated image sequen...
Fredrik Kahl, Anders Heyden
CVPR
2010
IEEE
1790views Computer Vision» more  CVPR 2010»
14 years 3 months ago
Data Driven Mean-Shift Belief Propagation For non-Gaussian MRFs
We introduce a novel data-driven mean-shift belief propagation (DDMSBP) method for non-Gaussian MRFs, which often arise in computer vision applications. With the aid of scale sp...
Minwoo Park, S. Kashyap, R. Collins, and Y. Liu