4084 search results - page 218 / 817 » Constraints in spatial structures |
230
click to vote
PVLDB
2010
15 years 5 months ago
2010
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
222
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
194
click to vote
ECCC
2006
15 years 7 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
208
click to vote
AADEBUG
1997
Springer
15 years 11 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
208
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 ...