Sciweavers

2976 search results - page 249 / 596
» On the bounded integer programming
Sort
View
ICDE
1995
IEEE
118views Database» more  ICDE 1995»
16 years 6 months ago
A Version Numbering Scheme with a Useful Lexicographical Order
We describe a numbering scheme for versions with alternatives that has a useful lexicographical ordering. The version hierarchy is a tree. By inspection of the version numbers, we...
Arthur M. Keller, Jeffrey D. Ullman
ICML
2006
IEEE
16 years 5 months ago
Efficient MAP approximation for dense energy functions
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...
Marius Leordeanu, Martial Hebert
ICML
2001
IEEE
16 years 5 months ago
Smoothed Bootstrap and Statistical Data Cloning for Classifier Evaluation
This work is concerned with the estimation of a classifier's accuracy. We first review some existing methods for error estimation, focusing on cross-validation and bootstrap,...
Gregory Shakhnarovich, Ran El-Yaniv, Yoram Baram
STACS
2009
Springer
15 years 12 months ago
Reverse Engineering Prefix Tables
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
Julien Clément, Maxime Crochemore, Giuseppi...
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 12 months ago
Iterating Octagons
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
Marius Bozga, Codruta Gîrlea, Radu Iosif