Sciweavers

5153 search results - page 536 / 1031
» Introduction to Randomized Algorithms
Sort
View
CVPR
2007
IEEE
16 years 9 months ago
Learning Visual Similarity Measures for Comparing Never Seen Objects
In this paper we propose and evaluate an algorithm that learns a similarity measure for comparing never seen objects. The measure is learned from pairs of training images labeled ...
Eric Nowak, Frédéric Jurie
ICIP
2008
IEEE
16 years 8 months ago
Implicit spatial inference with sparse local features
This paper introduces a novel way to leverage the implicit geometry of sparse local features (e.g. SIFT operator) for the purposes of object detection and segmentation. A two-clas...
Deirdre O'Regan, Anil C. Kokaram
MICCAI
2008
Springer
16 years 8 months ago
Nonrigid Registration of Dynamic Renal MR Images Using a Saliency Based MRF Model
Nonrigid registration of contrast-enhanced MR images is a difficult problem due to the change in pixel intensity caused by the washin and wash-out of the contrast agent. In this pa...
Dwarikanath Mahapatra, Ying Sun
ICML
2008
IEEE
16 years 7 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
16 years 7 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...