Sciweavers

13603 search results - page 287 / 2721
» On the Complexity of Computing Treelength
Sort
View
ISLPED
1996
ACM
102views Hardware» more  ISLPED 1996»
15 years 10 months ago
High-level power estimation and the area complexity of Boolean functions
Estimation of the area complexity of a Boolean function from its functional description is an important step towards a power estimation capability at the register transfer level (...
Mahadevamurty Nemani, Farid N. Najm
CORR
2007
Springer
169views Education» more  CORR 2007»
15 years 6 months ago
Algorithmic Complexity Bounds on Future Prediction Errors
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
Alexey V. Chernov, Marcus Hutter, Jürgen Schm...
ECCV
2004
Springer
15 years 11 months ago
AQUATICS Reconstruction Software: The Design of a Diagnostic Tool Based on Computer Vision Algorithms
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
Andrea Giachetti, Gianluigi Zanetti
FGCS
2007
106views more  FGCS 2007»
15 years 6 months ago
A parallel hybrid genetic algorithm for protein structure prediction on the computational grid
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
16 years 8 days ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz