7215 search results - page 152 / 1443 » On the Consistency of Ranking Algorithms |
VMV
2004
13 years 9 months ago
2004
Penalty approaches can be used to efficiently resolve collisions of dynamically simulated rigid and deformable objects. These methods compute penalty forces based on the penetrati...
PAMI
2008
13 years 8 months ago
2008
This paper develops a theory of frequency domain invariants in computer vision. We derive novel identities using spherical harmonics, which are the angular frequency domain analog ...
CONSTRAINTS
2002
13 years 7 months ago
2002
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...