2796 search results - page 253 / 560 » The coolest path problem |
167
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
151
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
We present algorithms for improved Viterbi decoding for the case of hidden semi-Markov models. By carefully constructing directed acyclic graphs, we pose the decoding problem as t...
157
click to vote
MICCAI
2009
Springer
16 years 7 months ago
2009
Springer
We develop an algorithm for brain connectivity assessment using geodesics in HARDI (high angular resolution diusion imaging). We propose to recast the problem of nding bers bundles...
158
click to vote
MICCAI
2003
Springer
16 years 7 months ago
2003
Springer
Needle insertion for percutaneous therapies is formulated as a trajectory planning and control problem. A new concept of needle steering is developed and a Needle Manipulation Jaco...
197
Voted
PODS
2004
ACM
16 years 6 months ago
2004
ACM
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unres...