Sciweavers

492 search results - page 97 / 99
» combinatorics 2006
Sort
View
CASES
2006
ACM
15 years 3 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
COLT
2006
Springer
15 years 1 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
DGCI
2006
Springer
15 years 1 months ago
Revisiting Digital Straight Segment Recognition
Abstract. This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognitio...
François de Vieilleville, Jacques-Olivier L...
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 1 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
CORR
2006
Springer
87views Education» more  CORR 2006»
14 years 9 months ago
Pseudorandomness and Combinatorial Constructions
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
Luca Trevisan