Sciweavers

2778 search results - page 135 / 556
» Limit complexities revisited
Sort
View
STACS
1999
Springer
15 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
BIS
2007
144views Business» more  BIS 2007»
15 years 7 months ago
Automated Integration Tests for Mobile Applications in Java 2 Micro Edition
Applications written for mobile devices have become more and more complex, adjusting to the constantly improving computational power of hardware. With the growing application size ...
Dawid Weiss, Marcin Zduniak
COR
2008
111views more  COR 2008»
15 years 6 months ago
An optimization algorithm for the inventory routing problem with continuous moves
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
Martin W. P. Savelsbergh, Jin-Hwa Song
PAMI
2006
185views more  PAMI 2006»
15 years 6 months ago
Generic Object Recognition with Boosting
This paper explores the power and the limitations of weakly supervised categorization. We present a complete framework that starts with the extraction of various local regions of e...
Andreas Opelt, Axel Pinz, Michael Fussenegger, Pet...
4OR
2004
79views more  4OR 2004»
15 years 6 months ago
Constrained auction clearing in the Italian electricity market
Most of the liberalized electricity systems use the auction as a market model. The complexity of the underlying optimization formulation depends on the technical and regulatory con...
Patrizia Beraldi, Domenico Conforti, Chefi Triki, ...