4860 search results - page 370 / 972 » SNPs Problems, Complexity, and Algorithms |
128
Voted
NIPS
2008
15 years 5 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
138
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
110
click to vote
ICRA
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
128
click to vote
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
142
Voted
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...