Sciweavers

5580 search results - page 621 / 1116
» Randomized priority algorithms
Sort
View
MICCAI
2008
Springer
16 years 6 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 5 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 5 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 5 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
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 5 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai