Sciweavers

1258 search results - page 236 / 252
» Architecture-driven Problem Decomposition
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition
We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is qui...
Alexander C. Berg, Hao Zhang 0003, Jitendra Malik,...
ECCV
2004
Springer
14 years 9 months ago
A l1-Unified Variational Framework for Image Restoration
Among image restoration literature, there are mainly two kinds of approach. One is based on a process over image wavelet coefficients, as wavelet shrinkage for denoising. The other...
Julien Bect, Laure Blanc-Féraud, Gilles Aub...
WWW
2009
ACM
14 years 8 months ago
Combining global optimization with local selection for efficient QoS-aware service composition
The run-time binding of web services has been recently put forward in order to support rapid and dynamic web service compositions. With the growing number of alternative web servi...
Mohammad Alrifai, Thomas Risse
KDD
2001
ACM
203views Data Mining» more  KDD 2001»
14 years 8 months ago
Ensemble-index: a new approach to indexing large databases
The problem of similarity search (query-by-content) has attracted much research interest. It is a difficult problem because of the inherently high dimensionality of the data. The ...
Eamonn J. Keogh, Selina Chu, Michael J. Pazzani
COCO
2009
Springer
105views Algorithms» more  COCO 2009»
14 years 2 months ago
Planar Graph Isomorphism is in Log-Space
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Th...