Sciweavers

451 search results - page 38 / 91
» Some Lower Bounds on Geometric Separability Problems
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
14 years 7 months ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud
MP
2010
128views more  MP 2010»
14 years 8 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 4 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
15 years 4 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
COCOON
2007
Springer
15 years 3 months ago
Streaming Algorithms Measured in Terms of the Computed Quantity
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
Shengyu Zhang