Sciweavers

51 search results - page 2 / 11
» On a universal best choice algorithm for partially ordered s...
Sort
View

Publication
794views
15 years 1 months ago
A Fast Implementation of The Level Set Method Without Solving Partial Differential Equations
"The level set method is popular in the numerical implementation of curve evolution, but its high computational cost is a bottleneck for real-time applications. In this report...
Yonggang Shi, William Clem Karl
KDD
2003
ACM
99views Data Mining» more  KDD 2003»
14 years 5 months ago
Fragments of order
High-dimensional collections of 0-1 data occur in many applications. The attributes in such data sets are typically considered to be unordered. However, in many cases there is a n...
Aristides Gionis, Teija Kujala, Heikki Mannila
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
13 years 9 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
CVPR
2009
IEEE
15 years 11 days ago
Isometric Registration of Ambiguous and Partial Data
This paper introduces a new shape matching algorithm for computing correspondences between 3D surfaces that have undergone (approximately) isometric deformations. The new approach ...
Art Tevs (Max Planck Institute Informatik), Martin...
SSWMC
2004
13 years 6 months ago
Universal image steganalysis using rate-distortion curves
The goal of image steganography is to embed information in a cover image using modifications that are undetectable. In actual practice, however, most techniques produce stego imag...
Mehmet Utku Celik, Gaurav Sharma, A. Murat Tekalp