Sciweavers

3715 search results - page 542 / 743
» A Space Optimization for FP-Growth
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 5 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
TIT
1998
216views more  TIT 1998»
15 years 5 months ago
Data Compression and Harmonic Analysis
In this article we review some recent interactions between harmonic analysis and data compression. The story goes back of course to Shannon’s R(D) theory in the case of Gaussian...
David L. Donoho, Martin Vetterli, Ronald A. DeVore...
ISDA
2010
IEEE
15 years 3 months ago
Avoiding simplification strategies by introducing multi-objectiveness in real world problems
Abstract--In business analysis, models are sometimes oversimplified. We pragmatically approach many problems with a single financial objective and include monetary values for non-m...
Charlotte J. C. Rietveld, Gijs P. Hendrix, Frank T...
TACAS
2010
Springer
255views Algorithms» more  TACAS 2010»
15 years 3 months ago
Satisfiability Modulo the Theory of Costs: Foundations and Applications
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
Alessandro Cimatti, Anders Franzén, Alberto...
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
15 years 3 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...