Sciweavers

1480 search results - page 222 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
CORR
2007
Springer
88views Education» more  CORR 2007»
15 years 3 months ago
Target assignment for robotic networks: asymptotic performance under limited communication
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
Stephen L. Smith, Francesco Bullo
195
Voted
CVPR
2009
IEEE
16 years 10 months ago
Illumination and Spatially Varying Specular Reflectance from a Single View
Estimating the illumination and the reflectance properties of an object surface from a sparse set of images is an important but inherently ill-posed problem. The problem becomes...
Kenji Hara (Kyushu University), Ko Nishino (Drexel...
TCBB
2008
117views more  TCBB 2008»
15 years 3 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
15 years 9 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
TIP
1998
114views more  TIP 1998»
15 years 3 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos