Sciweavers

327 search results - page 18 / 66
» Algorithms for infinite huffman-codes
Sort
View
ICPR
2006
IEEE
15 years 11 hour ago
A Novel Volumetric Shape from Silhouette Algorithm Based on a Centripetal Pentahedron Model
In this paper we present a novel volumetric shape from silhouette algorithm based on a centripetal pentahedron model. The algorithm first partitions the space with a set of infini...
Xin Liu, Hongxun Yao, Guilin Yao, Wen Gao
LICS
2010
IEEE
13 years 8 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
14 years 11 months ago
Complex tilings
Two infinite families of self-similar tilings are described which have apparently not been reported before. Each tiling is based on a single prototile that is a segment of a regul...
Bruno Durand, Leonid A. Levin, Alexander Shen
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
14 years 11 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
15 years 8 days ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas