412 search results - page 64 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
105
click to vote
ICALP
2009
Springer
16 years 10 hour ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
ISPD
2007
ACM
15 years 1 months ago
2007
ACM
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
BMCBI
2007
14 years 12 months ago
2007
Background: Genome-wide identification of specific oligonucleotides (oligos) is a computationallyintensive task and is a requirement for designing microarray probes, primers, and ...
100
click to vote
VLDB
2005
ACM
15 years 5 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
117
Voted
JAIR
2010
14 years 10 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...