Sciweavers

821 search results - page 61 / 165
» Energy Efficient Algorithms for the RFID Estimation Problem
Sort
View
NIPS
2008
13 years 10 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
GECCO
2006
Springer
182views Optimization» more  GECCO 2006»
14 years 15 days ago
Distributed genetic algorithm for energy-efficient resource management in sensor networks
In this work we consider energy-efficient resource management in an environment monitoring and hazard detection sensor network. Our goal is to allocate different detection methods...
Qinru Qiu, Qing Wu, Daniel J. Burns, Douglas Holzh...
CVPR
1998
IEEE
14 years 11 months ago
Markov Random Fields with Efficient Approximations
Markov Random Fields (MRF's) can be used for a wide variety of vision problems. In this paper we focus on MRF's with two-valued clique potentials, which form a generaliz...
Yuri Boykov, Olga Veksler, Ramin Zabih
ICDE
2008
IEEE
108views Database» more  ICDE 2008»
14 years 10 months ago
Self-Join Size Estimation in Large-scale Distributed Data Systems
In this work we tackle the open problem of self-join size (SJS) estimation in a large-scale Distributed Data System, where tuples of a relation are distributed over data nodes whic...
Theoni Pitoura, Peter Triantafillou
IROS
2009
IEEE
151views Robotics» more  IROS 2009»
14 years 3 months ago
A comparison of SLAM algorithms based on a graph of relations
— In this paper, we address the problem of creating an objective benchmark for comparing SLAM approaches. We propose a framework for analyzing the results of SLAM approaches base...
Wolfram Burgard, Cyrill Stachniss, Giorgio Grisett...