Sciweavers

7167 search results - page 815 / 1434
» Answer Set Programming
Sort
View
CP
2009
Springer
16 years 7 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
CHI
2009
ACM
16 years 7 months ago
Graph sketcher: extending illustration to quantitative graphs
Scientists, engineers, and educators commonly need to make graphs that quickly illustrate quantitative ideas yet are not based on specific data sets. We call these graphs quantita...
Robin Stewart, m. c. schraefel
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 6 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
PODS
2008
ACM
158views Database» more  PODS 2008»
16 years 6 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
181
Voted
ICFP
2003
ACM
16 years 6 months ago
Compiler implementation in a formal logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
Jason Hickey, Aleksey Nogin, Adam Granicz