Sciweavers

1554 search results - page 296 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CVPR
2008
IEEE
16 years 1 days ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
ICIP
2002
IEEE
15 years 11 months ago
Efficient video similarity measurement with video signature
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
Sen-Ching S. Cheung, Avideh Zakhor
GIS
2008
ACM
15 years 11 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
ICML
2004
IEEE
15 years 11 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
15 years 10 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel