16404 search results - page 135 / 3281 » A set coverage problem |
122
Voted
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smalles...
135
click to vote
ESA
2005
Springer
15 years 8 months ago
2005
Springer
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
118
click to vote
EUSFLAT
2003
15 years 4 months ago
2003
In this paper we propose a random set framework for learning linguistic models for prediction problems. We show how we can model prediction problems based on learning linguistic p...
124
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
146
Voted
FOCM
2010
15 years 1 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...