Sciweavers

2520 search results - page 136 / 504
» The complexity of approximating entropy
Sort
View
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
15 years 4 months ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
DAGSTUHL
2004
15 years 2 days ago
Information-Based Nonlinear Approximation: An Average Case Setting
Nonlinear approximation has usually been studied under deterministic assumptions and complete information about the underlying functions. In the present paper we assume only partia...
Leszek Plaskota
VLDB
2001
ACM
144views Database» more  VLDB 2001»
15 years 11 months ago
Approximate query processing using wavelets
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
Kaushik Chakrabarti, Minos N. Garofalakis, Rajeev ...
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 5 months ago
Multiplicative approximations and the hypervolume indicator
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
Tobias Friedrich, Christian Horoba, Frank Neumann
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
15 years 5 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz