Sciweavers

762 search results - page 41 / 153
» Finding Facilities Fast
Sort
View
JMIV
2006
166views more  JMIV 2006»
14 years 9 months ago
Fast Surface Segmentation Guided by User Input Using Implicit Extension of Minimal Paths
We introduce a novel implicit approach for single object segmentation in 3D images. The boundary surface of this object is assumed to contain two or more known curves (the constrai...
Roberto Ardon, Laurent D. Cohen, Anthony J. Yezzi
TIP
2002
109views more  TIP 2002»
14 years 9 months ago
Adaptive rood pattern search for fast block-matching motion estimation
In this paper, we propose a novel and simple fast block-matching algorithm (BMA), called adaptive rood pattern search (ARPS), which consists of two sequential search stages: 1) ini...
Yao Nie, Kai-Kuang Ma
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
15 years 11 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
DAC
2004
ACM
15 years 10 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
15 years 10 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry