Sciweavers

7215 search results - page 22 / 1443
» On the Consistency of Ranking Algorithms
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
14 years 2 months ago
Unsupervised Face Annotation by Mining the Web
Searching for images of people is an essential task for image and video search engines. However, current search engines have limited capabilities for this task since they rely on ...
Duy-Dinh Le, Shin'ichi Satoh
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
WWW
2010
ACM
14 years 2 months ago
RankCompete: simultaneous ranking and clustering of web photos
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
Liangliang Cao, Andrey Del Pozo, Xin Jin, Jiebo Lu...
IPL
2006
87views more  IPL 2006»
13 years 7 months ago
Vertex rankings of chordal graphs and weighted trees
: In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem o...
Dariusz Dereniowski, Adam Nadolski