Sciweavers

8094 search results - page 61 / 1619
» Improvements in Formula Generalization
Sort
View
TIT
1998
96views more  TIT 1998»
13 years 8 months ago
Sequential Prediction of Individual Sequences Under General Loss Functions
Abstract— We consider adaptive sequential prediction of arbitrary binary sequences when the performance is evaluated using a general loss function. The goal is to predict on each...
David Haussler, Jyrki Kivinen, Manfred K. Warmuth
CVPR
2006
IEEE
14 years 3 months ago
A Shape Representation for Planar Curves by Shape Signature Harmonic Embedding
This paper introduces a new representation for planar curves. From the well-known Dirichlet problem for a disk, the harmonic function embedded in a circular disk is solely depende...
Sang-Mook Lee, A. Lynn Abbott, Neil A. Clark, Phil...
TABLEAUX
2009
Springer
14 years 1 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
ESOP
2008
Springer
13 years 10 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 9 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...