Sciweavers

5138 search results - page 556 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
184
Voted
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
179
Voted
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...
STOC
2006
ACM
131views Algorithms» more  STOC 2006»
16 years 7 months ago
On maximizing welfare when utility functions are subadditive
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
Uriel Feige