412 search results - page 41 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
104
click to vote
BIOINFORMATICS
2002
15 years 1 months ago
2002
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
112
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
—In embedded computing we face a continuously growing algorithm complexity combined with a constantly rising number of applications running on a single system. Multi-core systems...
111
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
124
click to vote
VLDB
2002
ACM
15 years 1 months ago
2002
ACM
Query optimization is a computationally intensive process, especially for complex queries. We present here a tool, called PLASTIC, that can be used by query optimizers to amortize...
108
click to vote
JCP
2007
15 years 1 months ago
2007
— Following a toxic contaminant release, either accidental or intentional, predicting the transport and dispersion of the contaminant becomes a critical problem for Homeland Defe...