4112 search results - page 439 / 823 » Efficient Algorithms for the Spoonerism Problem |
217
click to vote
IJRR
2008
15 years 7 months ago
2008
Automatically building maps from sensor data is a necessary and fundamental skill for mobile robots; as a result, considerable research attention has focused on the technical chall...
223
click to vote
CSCW
2002
ACM
15 years 7 months ago
2002
ACM
Bitmap-based collaborative graphics editing systems are a special class of real-time collaborative editing systems. Undo is an important and difficult problem in these systems. Ex...
207
click to vote
DM
1999
15 years 7 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
214
click to vote
TIT
2002
15 years 7 months ago
2002
We consider the problem of binary hypothesis testing using binary decisions from independent and identically distributed (i.i.d). sensors. Identical likelihood-ratio quantizers wit...
203
click to vote
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
Many problems in computer vision can be modeled using
conditional Markov random fields (CRF). Since finding
the maximum a posteriori (MAP) solution in such models
is NP-hard, mu...