Sciweavers

1016 search results - page 10 / 204
» Generalized distances between rankings
Sort
View
ECML
2007
Springer
14 years 4 months ago
Learning Metrics Between Tree Structured Data: Application to Image Recognition
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
Laurent Boyer 0002, Amaury Habrard, Marc Sebban
ACCV
2009
Springer
14 years 4 months ago
Twisted Cubic: Degeneracy Degree and Relationship with General Degeneracy
Fundamental matrix, drawing geometric relationship between two images, plays an important role in 3-dimensional computer vision. Degenerate configurations of space points and two ...
Tian Lan, Yihong Wu, Zhanyi Hu
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 8 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
TALG
2008
81views more  TALG 2008»
13 years 10 months ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
CORR
2007
Springer
129views Education» more  CORR 2007»
13 years 10 months ago
A Rank-Metric Approach to Error Control in Random Network Coding
It is shown that the error control problem in random network coding can be reformulated as a generalized decoding problem for rank-metric codes. This result allows many of the too...
Danilo Silva, Frank R. Kschischang, Ralf Koetter