Sciweavers

247 search results - page 30 / 50
» Scaling up all pairs similarity search
Sort
View
ECCV
2010
Springer
15 years 4 months 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...
82
Voted
BMCBI
2007
107views more  BMCBI 2007»
14 years 11 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»
16 years 5 days 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»
14 years 11 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»
14 years 10 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