Sciweavers

4843 search results - page 401 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
15 years 5 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 4 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
125
Voted
IJBC
2002
109views more  IJBC 2002»
15 years 4 months ago
Cnn Dynamics represents a Broader Class than PDES
The relationship between Cellular Nonlinear Networks (CNNs) and Partial Differential Equations (PDEs) is investigated. The equivalence between discrete-space CNN models and contin...
Marco Gilli, Tamás Roska, Leon O. Chua, Pie...
PRL
2008
118views more  PRL 2008»
15 years 4 months ago
Bayes Machines for binary classification
In this work we propose an approach to binary classification based on an extension of Bayes Point Machines. Particularly, we take into account the whole set of hypotheses that are...
Daniel Hernández-Lobato, José Miguel...
139
Voted
JAIR
2010
131views more  JAIR 2010»
15 years 3 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan