4047 search results - page 352 / 810 » The Discrete Basis Problem |
135
click to vote
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
187
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
166
click to vote
AI
2010
Springer
15 years 5 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
141
click to vote
AI
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
137
click to vote
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper proposes an algorithm to solve most of existing active contour problems based on the approach of mean curvature motion proposed by Chambolle in [1] and the image denois...