Sciweavers

1139 search results - page 121 / 228
» Bounded Ideation Theory
Sort
View
ICALP
2010
Springer
14 years 21 days ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
PODS
2000
ACM
146views Database» more  PODS 2000»
14 years 8 days ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
COLT
2000
Springer
14 years 7 days ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
APN
1999
Springer
14 years 6 days ago
Structural Methods to Improve the Symbolic Analysis of Petri Nets
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
Enric Pastor, Jordi Cortadella, Marco A. Peñ...
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
14 years 4 days ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu