412 search results - page 78 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
141
click to vote
CCA
2009
Springer
15 years 2 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
154
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
One of the simplest ways to query a database is through a form, where a user can fill in relevant information and obtain desired results by submitting the form. Designing good sta...
92
Voted
BICOB
2009
Springer
15 years 4 months ago
2009
Springer
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
RT
2004
Springer
15 years 2 months ago
2004
Springer
Despite recent advances in finding efficient LOD-representations for gigantic 3D objects, rendering of complex, gigabyte-sized models and environments is still a challenging tas...