Sciweavers

247 search results - page 30 / 50
» Scaling up all pairs similarity search
Sort
View
ECCV
2010
Springer
14 years 7 days ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
BMCBI
2007
107views more  BMCBI 2007»
13 years 7 months ago
A computational approach for detecting peptidases and their specific inhibitors at the genome level
Background: Peptidases are proteolytic enzymes responsible for fundamental cellular activities in all organisms. Apparently about 2–5% of the genes encode for peptidases, irresp...
Lisa Bartoli, Remo Calabrese, Piero Fariselli, Dam...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 8 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
TASLP
2008
176views more  TASLP 2008»
13 years 7 months ago
Analysis of Minimum Distances in High-Dimensional Musical Spaces
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Michael Casey, Christophe Rhodes, Malcolm Slaney
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
Scalable Discovery of Best Clusters on Large Graphs
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
Kathy Macropol, Ambuj K. Singh