Sciweavers

388 search results - page 57 / 78
» Quantum Lower Bounds by Polynomials
Sort
View
ILP
2003
Springer
14 years 2 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon
ICALP
2010
Springer
14 years 1 months ago
Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor W...
CPM
2000
Springer
136views Combinatorics» more  CPM 2000»
14 years 1 months ago
Approximating the Maximum Isomorphic Agreement Subtree Is Hard
The Maximum Isomorphic Agreement Subtree (MIT) problem is one of the simplest versions of the Maximum Interval Weight Agreement Subtree method (MIWT) which is used to compare phyl...
Paola Bonizzoni, Gianluca Della Vedova, Giancarlo ...
ISLPED
1996
ACM
72views Hardware» more  ISLPED 1996»
14 years 28 days ago
Simultaneous buffer and wire sizing for performance and power optimization
In this paper, we study the simultaneous buffer and wire sizing (SBWS) problem for delay and power dissipation minimization. We prove the BS/WS relation for optimal SBWS solutions...
Jason Cong, Cheng-Kok Koh, Kwok-Shing Leung
ECSQARU
1995
Springer
14 years 10 days ago
Parametric Structure of Probabilities in Bayesian Networks
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
Enrique Castillo, José Manuel Gutiér...