1647 search results - page 108 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
119
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
146
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
151
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
153
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
181
Voted
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...