Sciweavers

814 search results - page 158 / 163
» Optimal pairings
Sort
View
AAAI
2006
13 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 11 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar
SODA
2003
ACM
106views Algorithms» more  SODA 2003»
13 years 11 months ago
Maintaining all-pairs approximate shortest paths under deletion of edges
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
Surender Baswana, Ramesh Hariharan, Sandeep Sen
MM
2010
ACM
238views Multimedia» more  MM 2010»
13 years 10 months ago
Supervised manifold learning for image and video classification
This paper presents a supervised manifold learning model for dimensionality reduction in image and video classification tasks. Unlike most manifold learning models that emphasize ...
Yang Liu, Yan Liu, Keith C. C. Chan
BMCBI
2010
163views more  BMCBI 2010»
13 years 10 months ago
Reduced representation of protein structure: implications on efficiency and scope of detection of structural similarity
Background: Computational comparison of two protein structures is the starting point of many methods that build on existing knowledge, such as structure modeling (including modeli...
Zong Hong Zhang, Hwee Kuan Lee, Ivana Mihalek