Sciweavers

1016 search results - page 16 / 204
» Generalized distances between rankings
Sort
View
ICIP
2003
IEEE
14 years 11 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
14 years 11 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
ICML
2007
IEEE
14 years 10 months ago
Learning random walks to rank nodes in graphs
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
Alekh Agarwal, Soumen Chakrabarti
FGR
2008
IEEE
180views Biometrics» more  FGR 2008»
14 years 4 months ago
Image-set matching using a geodesic distance and cohort normalization
An image-set based face recognition algorithm is proposed that exploits the full geometrical interpretation of Canonical Correlation Analysis (CCA). CCA maximizes the correlation ...
Yui Man Lui, J. Ross Beveridge, Bruce A. Draper, M...
SODA
2003
ACM
158views Algorithms» more  SODA 2003»
13 years 11 months ago
Comparing top k lists
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
Ronald Fagin, Ravi Kumar, D. Sivakumar