2520 search results - page 53 / 504 » The complexity of approximating entropy |
172
click to vote
ESA
2011
Springer
13 years 9 months ago
2011
Springer
Self-indexes can represent a text in asymptotically optimal space under the k-th order entropy model, give access to text substrings, and support indexed pattern searches. Their ti...
RECOMB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Given the substantial computational requirements of stochastic simulation, approximation is essential for efficient analysis of any realistic biochemical system. This pap...
169
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
BC
2006
14 years 10 months ago
2006
The part of the primate visual cortex responsible for the recognition of objects is parcelled into about a dozen areas organized somewhat hierarchically (the region is called the v...
GRAPHICSINTERFACE
1996
14 years 11 months ago
1996
We present a new method for accelerating the rendering of complex static scenes. The technique is applicable to unstructured scenes containing arbitrary geometric primitives and h...