Sciweavers

675 search results - page 126 / 135
» On Compression of Parse Trees
Sort
View
CORR
2007
Springer
140views Education» more  CORR 2007»
13 years 8 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
LOGCOM
2007
89views more  LOGCOM 2007»
13 years 8 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
CGF
2010
139views more  CGF 2010»
13 years 3 months ago
Visualization of Large-Scale Urban Models through Multi-Level Relief Impostors
In this paper, we present an efficient approach for the interactive rendering of large-scale urban models, which can be integrated seamlessly with virtual globe applications. Our ...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
ICDM
2007
IEEE
99views Data Mining» more  ICDM 2007»
14 years 2 months ago
Optimizing Frequency Queries for Data Mining Applications
Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requi...
Hassan H. Malik, John R. Kender
EDUTAINMENT
2007
Springer
14 years 16 days ago
View-Dependent Hierarchical Foliage Simplification
High compression of plant geometry is an important aspect in fast realistic visualization of plants. Hierarchical structuring plant morphology is a key factor for real time plant r...
Qingqiong Deng, Xiaopeng Zhang, Marc Jaeger