Sciweavers

604 search results - page 39 / 121
» The Hardness of Metric Labeling
Sort
View
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
PROMISE
2010
13 years 2 months ago
Better, faster, and cheaper: what is better software?
Background: Defects are related to failures and they do not have much power for indicating a higher quality or a better system above the baseline that the end-users expect. Nevert...
Burak Turhan, Çetin Meriçli, Tekin M...
CVPR
2007
IEEE
14 years 10 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
ACCV
2009
Springer
14 years 2 months ago
Iterated Graph Cuts for Image Segmentation
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
Bo Peng, Lei Zhang, Jian Yang
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Audio tonality mode classification without tonic annotations
Traditional tonality mode (major or minor) classification or audio key finding algorithms often rely on tonic annotations (key names) of the training songs. However, unlike clas...
Zhiyao Duan, Lie Lu, Changshui Zhang