Sciweavers

455 search results - page 63 / 91
» The Linear Logical Abstract Machine
Sort
View
AGP
1999
IEEE
15 years 2 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
INFORMS
1998
150views more  INFORMS 1998»
14 years 9 months ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
IJCNN
2008
IEEE
15 years 4 months ago
Learning adaptive subject-independent P300 models for EEG-based brain-computer interfaces
Abstract— This paper proposes an approach to learn subjectindependent P300 models for EEG-based brain-computer interfaces. The P300 models are first learned using a pool of exis...
Shijian Lu, Cuntai Guan, Haihong Zhang
COLT
2004
Springer
15 years 3 months ago
An Inequality for Nearly Log-Concave Distributions with Applications to Learning
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
Constantine Caramanis, Shie Mannor
69
Voted
ICALP
2004
Springer
15 years 3 months ago
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
Olivier Bournez, Emmanuel Hainry