Sciweavers

167 search results - page 16 / 34
» Constraints for closest point finding
Sort
View
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 9 months ago
Deflating the Dimensionality Curse Using Multiple Fractal Dimensions
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
Bernd-Uwe Pagel, Flip Korn, Christos Faloutsos
ICDE
2011
IEEE
240views Database» more  ICDE 2011»
12 years 11 months ago
Similarity measures for multidimensional data
— How similar are two data-cubes? In other words, the question under consideration is: given two sets of points in a multidimensional hierarchical space, what is the distance val...
Eftychia Baikousi, Georgios Rogkakos, Panos Vassil...
ICCV
2003
IEEE
14 years 10 months ago
Constraining Human Body Tracking
Our paper addresses the problem of enforcing constraints in human body tracking. A projection technique is derived to impose kinematic constraints on independent multi-body motion...
David Demirdjian, Teresa Ko, Trevor Darrell
DAARC
2007
Springer
120views Algorithms» more  DAARC 2007»
14 years 2 months ago
Empirically Assessing Effects of the Right Frontier Constraint
In a questionnaire study the effects of discourse structural information on resolving inter-sentential anaphora were investigated. The Right Frontier Constraint, first proposed by ...
Anke Holler, Lisa Irmen
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 8 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson