Sciweavers

14158 search results - page 15 / 2832
» Generalized switch-setting problems
Sort
View
TIT
2011
119views more  TIT 2011»
13 years 4 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
ICRA
2010
IEEE
265views Robotics» more  ICRA 2010»
13 years 8 months ago
A generalization of the metric-based Iterative Closest Point technique for 3D scan matching
— Scan matching techniques have been widely used to compute the displacement of robots. This estimate is part of many algorithms addressing navigation and mapping. This paper add...
Leopoldo Armesto, Javier Minguez, Luis Montesano
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 8 months ago
A general Gaussian-mixture approach for range-only mapping using multiple hypotheses
— Radio signal-based localization and mapping is becoming more interesting as applications involving the collaboration between robots and static wireless devices are more common....
Fernando Caballero, Luis Merino, Aníbal Oll...
ORL
1998
116views more  ORL 1998»
13 years 9 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry