2520 search results - page 312 / 504 » The complexity of approximating entropy |
176
click to vote
FSMNLP
2005
Springer
16 years 2 days ago
2005
Springer
TAGH is a system for automatic recognition of German word forms. It is based on a stem lexicon with allomorphs and a concatenative mechanism for inflection and word formation. Wei...
204
click to vote
GECCO
2005
Springer
16 years 2 days ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
146
click to vote
VLDB
2005
ACM
16 years 1 days ago
2005
ACM
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
167
click to vote
DIALM
2004
ACM
15 years 12 months ago
2004
ACM
In many applications of wireless ad hoc and sensor networks, position-awareness is of great importance. Often, as in the case of geometric routing, it is sufficient to have virtua...
180
click to vote
CAV
2004
Springer
15 years 12 months ago
2004
Springer
Model checking of infinite state systems is undecidable, therefore, there are instances for which fixpoint computations used in infinite state model checkers do not converge. Gi...