Sciweavers

905 search results - page 179 / 181
» On the Complexity of uSPR Distance
Sort
View
IJCV
2010
168views more  IJCV 2010»
13 years 5 months ago
Baselines for Image Annotation
Automatically assigning keywords to images is of great interest as it allows one to retrieve, index, organize and understand large collections of image data. Many techniques have b...
Ameesh Makadia, Vladimir Pavlovic, Sanjiv Kumar
PVLDB
2008
107views more  PVLDB 2008»
13 years 5 months ago
Constrained locally weighted clustering
Data clustering is a difficult problem due to the complex and heterogeneous natures of multidimensional data. To improve clustering accuracy, we propose a scheme to capture the lo...
Hao Cheng, Kien A. Hua, Khanh Vu
SPIRE
2010
Springer
13 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
BMVC
2010
13 years 5 months ago
Diffusion-based Regularisation Strategies for Variational Level Set Segmentation
Variational level set methods are formulated as energy minimisation problems, which are often solved by gradient-based optimisation methods, such as gradient descent. Unfortunatel...
Maximilian Baust, Darko Zikic, Nassir Navab
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 7 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck