Sciweavers

3946 search results - page 425 / 790
» The computational complexity of choice sets
Sort
View
CG
2007
Springer
15 years 7 months ago
Fast continuous collision detection among deformable models using graphics processors
We present an interactive algorithm to perform continuous collision detection between general deformable models using graphics processors (GPUs). We model the motion of each objec...
Naga K. Govindaraju, Ilknur Kabul, Ming C. Lin, Di...
PODS
2004
ACM
158views Database» more  PODS 2004»
16 years 7 months ago
Composing Schema Mappings: Second-Order Dependencies to the Rescue
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Phokion G. Kolaitis, Lucian Popa, Wa...
CVPR
2008
IEEE
16 years 9 months ago
ANSIG - An analytic signature for permutation-invariant two-dimensional shape representation
Many applications require a computer representation of 2D shape, usually described by a set of 2D points. The challenge of this representation is that it must not only capture the...
José J. Rodrigues, Pedro M. Q. Aguiar, Jo&a...
PODS
2010
ACM
242views Database» more  PODS 2010»
16 years 20 days ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
RTSS
2002
IEEE
16 years 15 days ago
The Space of Rate Monotonic Schedulability
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...
Enrico Bini, Giorgio C. Buttazzo