16404 search results - page 774 / 3281 » A set coverage problem |
227
click to vote
CP
2006
Springer
15 years 11 months ago
2006
Springer
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
201
click to vote
3DIM
2001
IEEE
15 years 11 months ago
2001
IEEE
A novel solution is presented to the Nearest Neighbor Problem that is specifically tailored for determining correspondences within the Iterative Closest Point Algorithm. The refer...
180
Voted
COCOC
1995
15 years 11 months ago
1995
We consider the collection of all spanning trees of a graph with distance between them based on the size of the symmetric difference of their edge sets. A central spanning tree o...
181
Voted
EMNLP
2008
15 years 9 months ago
2008
In this paper, we first introduce a new architecture for parsing, bidirectional incremental parsing. We propose a novel algorithm for incremental construction, which can be applie...
189
click to vote
WALCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...