Sciweavers

327 search results - page 4 / 66
» Algorithms for infinite huffman-codes
Sort
View
PKDD
2010
Springer
177views Data Mining» more  PKDD 2010»
13 years 5 months ago
ITCH: Information-Theoretic Cluster Hierarchies
Hierarchical clustering methods are widely used in various scientific domains such as molecular biology, medicine, economy, etc. Despite the maturity of the research field of hie...
Christian Böhm, Frank Fiedler, Annahita Oswal...
PG
2000
IEEE
13 years 11 months ago
Progressive Geometry Compression for Meshes
A novel progressive geometry compression scheme is presented in the paper. In this scheme a mesh is represented as a base mesh followed by some groups of vertex split operations us...
Xinguo Liu, Hujun Bao, Qunsheng Peng, Pheng-Ann He...
IOR
2010
98views more  IOR 2010»
13 years 4 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 5 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
EMNLP
2009
13 years 5 months ago
The infinite HMM for unsupervised PoS tagging
We extend previous work on fully unsupervised part-of-speech tagging. Using a non-parametric version of the HMM, called the infinite HMM (iHMM), we address the problem of choosing...
Jurgen Van Gael, Andreas Vlachos, Zoubin Ghahraman...