Sciweavers

7006 search results - page 609 / 1402
» Approximation Algorithms
Sort
View
ALGORITHMICA
2004
125views more  ALGORITHMICA 2004»
15 years 7 months ago
Multidimensional Cube Packing
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
Yoshiharu Kohayakawa, Flávio Keidi Miyazawa...
COLT
1993
Springer
15 years 11 months ago
Learning from a Population of Hypotheses
We introduce a new formal model in which a learning algorithm must combine a collection of potentially poor but statistically independent hypothesis functions in order to approxima...
Michael J. Kearns, H. Sebastian Seung
AAAI
2000
15 years 8 months ago
Multivariate Clustering by Dynamics
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
Marco Ramoni, Paola Sebastiani, Paul R. Cohen
TPDS
2008
136views more  TPDS 2008»
15 years 7 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
GECCO
2005
Springer
144views Optimization» more  GECCO 2005»
16 years 23 days ago
Multiobjective hBOA, clustering, and scalability
This paper describes a scalable algorithm for solving multiobjective decomposable problems by combining the hierarchical Bayesian optimization algorithm (hBOA) with the nondominat...
Martin Pelikan, Kumara Sastry, David E. Goldberg