Sciweavers

15485 search results - page 23 / 3097
» Computing Optimal Subsets
Sort
View
CCCG
2007
13 years 9 months ago
Largest Subsets of Triangles in a Triangulation
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...
Boris Aronov, Marc J. van Kreveld, Maarten Lö...
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
ICCL
1992
IEEE
13 years 11 months ago
An automatically generated and provably correct compiler for a subset of Ada
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada. The compiler is generated from an emantic description; it emits absolute code ...
Jens Palsberg
ICGA
1997
133views Optimization» more  ICGA 1997»
13 years 9 months ago
Messy Genetic Algorithms for Subset Feature Selection
Subset Feature Selection problems can have severalattributes which may make Messy Genetic Algorithms an appropriateoptimization method. First, competitive solutions may often use ...
L. Darrell Whitley, J. Ross Beveridge, Cesar Guerr...
PODS
2005
ACM
151views Database» more  PODS 2005»
14 years 7 months ago
Estimating arbitrary subset sums with few probes
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel ...