Sciweavers

848 search results - page 29 / 170
» Randomness and the linear degrees of computability
Sort
View
AINA
2006
IEEE
15 years 1 months ago
Distributed Tuning Attempt Probability for Data Gathering in Random Access Wireless Sensor Networks
In this paper, we study the problem of data gathering in multi-hop wireless sensor networks. To tackle the high degree of channel contention and high probability of packet collisi...
Haibo Zhang, Hong Shen
INFOCOM
2010
IEEE
14 years 10 months ago
Network Coding Tomography for Network Failures
—Network Tomography (or network monitoring) uses end-to-end path-level measurements to characterize the network, such as topology estimation and failure detection. This work prov...
Hongyi Yao, Sidharth Jaggi, Minghua Chen
HEURISTICS
1998
103views more  HEURISTICS 1998»
14 years 11 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
ICCV
2007
IEEE
16 years 1 months ago
LogCut - Efficient Graph Cut Optimization for Markov Random Fields
Markov Random Fields (MRFs) are ubiquitous in lowlevel computer vision. In this paper, we propose a new approach to the optimization of multi-labeled MRFs. Similarly to -expansion...
Victor S. Lempitsky, Carsten Rother, Andrew Blake
IJCV
2012
13 years 2 months ago
Impact of Landmark Parametrization on Monocular EKF-SLAM with Points and Lines
Abstract This paper explores the impact that landmark parametrization has in the performance of monocular, EKFbased, 6-DOF simultaneous localization and mapping (SLAM) in the conte...
Joan Solà, Teresa A. Vidal-Calleja, Javier ...