4524 search results - page 280 / 905 » The Complexity of Global Constraints |
227
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
165
click to vote
ICDT
2005
ACM
16 years 9 days ago
2005
ACM
The traditional way of representing motion in 3D space-time uses a trajectory, i.e. a sequence of (x,y,t) points. Such a trajectory may be produced by periodic sampling of a Global...
214
click to vote
DELOS
2000
15 years 8 months ago
2000
: We explore the complex problem of providing searching services across interoperable heterogeneous federated digital library systems with rich structure and content. We discuss sy...
192
click to vote
VMCAI
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
163
Voted
DICTA
2003
15 years 8 months ago
2003
Abstract. Unit quaternion is an ideal parameterization for joint rotations. However, due to the complexity of the geometry of S3 group, it’s hard to specify meaningful joint cons...