498 search results - page 39 / 100 » Measuring the Complexity of Polygonal Objects |
PODS
2008
ACM
14 years 11 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
EACL
1993
ACL Anthology
14 years 10 days ago
1993
ACL Anthology
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
ESANN
2007
14 years 14 days ago
2007
Any order parameter quantifying the degree of organisation in a physical system can be studied in connection to source extraction algorithms. Independent component analysis (ICA) b...
CVPR
2007
IEEE
15 years 1 months ago
2007
IEEE
We present an approach for measuring similarity between visual entities (images or videos) based on matching internal self-similarities. What is correlated across images (or acros...