Sciweavers

9572 search results - page 252 / 1915
» Cover Algorithms and Their Combination
Sort
View
COLT
2000
Springer
15 years 11 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
ICLP
1997
Springer
15 years 10 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
DLT
2006
15 years 8 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
JAL
2006
175views more  JAL 2006»
15 years 6 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin

Book
5381views
17 years 5 months ago
Image Processing in C
"This book is a tutorial on image processing. Each chapter explains basic concepts with words and gures, shows image processing results with photographs, and implements the...
D. Phillips