Sciweavers

531 search results - page 65 / 107
» A Better Algorithm for Random k-SAT
Sort
View
MICCAI
2008
Springer
14 years 9 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
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 5 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
EVOW
2003
Springer
14 years 1 months ago
Search Space Analysis of the Linear Ordering Problem
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
Tommaso Schiavinotto, Thomas Stützle
KDD
2005
ACM
205views Data Mining» more  KDD 2005»
14 years 1 months ago
Feature bagging for outlier detection
Outlier detection has recently become an important problem in many industrial and financial applications. In this paper, a novel feature bagging approach for detecting outliers in...
Aleksandar Lazarevic, Vipin Kumar
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin