2520 search results - page 412 / 504 » The complexity of approximating entropy |
156
click to vote
ALT
1997
Springer
15 years 8 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...
156
Voted
ECML
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
139
click to vote
SIGGRAPH
1996
ACM
15 years 8 months ago
1996
ACM
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
128
click to vote
SSD
1993
Springer
15 years 8 months ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
132
click to vote
SIGGRAPH
1992
ACM
15 years 8 months ago
1992
ACM
We present a new radiosi[y algorithm for efficiently computing global solutions with respect to a constrained set of views. Radiosi ties of directly visible surfaces are computed ...