Sciweavers

141 search results - page 14 / 29
» Fast probabilistic snake algorithm
Sort
View
83
Voted
SAC
2006
ACM
15 years 3 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
IMC
2003
ACM
15 years 2 months ago
Bitmap algorithms for counting active flows on high speed links
—This paper presents a family of bitmap algorithms that address the problem of counting the number of distinct header patterns (flows) seen on a high-speed link. Such counting c...
Cristian Estan, George Varghese, Mike Fisk
TMI
2010
123views more  TMI 2010»
14 years 8 months ago
Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren...
EDBT
2010
ACM
185views Database» more  EDBT 2010»
14 years 11 months ago
Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space
The availability of indoor positioning renders it possible to deploy location-based services in indoor spaces. Many such services will benefit from the efficient support for k n...
Bin Yang 0002, Hua Lu, Christian S. Jensen
SIGMOD
2002
ACM
134views Database» more  SIGMOD 2002»
15 years 9 months ago
Wavelet synopses with error guarantees
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
Minos N. Garofalakis, Phillip B. Gibbons