Sciweavers

559 search results - page 80 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
ANOR
2004
116views more  ANOR 2004»
13 years 8 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
ICRA
2006
IEEE
102views Robotics» more  ICRA 2006»
14 years 2 months ago
Fast Iterative Alignment of Pose Graphs with Poor Initial Estimates
— A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms ...
Edwin Olson, John J. Leonard, Seth J. Teller
DEBS
2011
ACM
13 years 8 days ago
Declarative data-driven coordination
Many data-driven social and Web applications involve collaboration and coordination. The vision of declarative data-driven coordination (D3C), proposed in [9], is to support coord...
Johannes Gehrke
ICC
2007
IEEE
185views Communications» more  ICC 2007»
14 years 3 months ago
Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
James C. F. Li, Subhrakanti Dey, Jamie S. Evans
ICIP
2005
IEEE
14 years 10 months ago
Fast distortion-buffer optimized streaming of multimedia
This paper presents a distortion optimized streaming algorithm for on-demand streaming of multimedia. Given the pre-encoded packets of a multimedia stream, we propose a fast algor...
Anshul Sehgal, Ashish Jagmohan, Olivier Verscheure...