413 search results - page 22 / 83 » On Solving Geometric Optimization Problems Using Shortest Pa... |
106
click to vote
CCCG
2007
15 years 3 months ago
2007
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
112
Voted
ICMCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...
145
Voted
AOR
2010
14 years 11 months ago
2010
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
138
click to vote
CONSTRAINTS
2006
15 years 1 months ago
2006
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
170
Voted
CGIM
2003
15 years 3 months ago
2003
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...