Sciweavers

3875 search results - page 478 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
SDM
2007
SIAM
109views Data Mining» more  SDM 2007»
15 years 8 months ago
Segmentations with Rearrangements
Sequence segmentation is a central problem in the analysis of sequential and time-series data. In this paper we introduce and we study a novel variation to the segmentation proble...
Aristides Gionis, Evimaria Terzi
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
16 years 7 days ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
AAIM
2008
Springer
94views Algorithms» more  AAIM 2008»
16 years 1 months ago
Speed Scaling with a Solar Cell
We consider the setting of a device that obtains it energy from a battery and some regenerative source such as a solar cell. We consider the speed scaling problem of scheduling a c...
Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs
ICANN
2007
Springer
16 years 25 days ago
Input Selection for Radial Basis Function Networks by Constrained Optimization
Input selection in the nonlinear function approximation is important and difficult problem. Neural networks provide good generalization in many cases, but their interpretability is...
Jarkko Tikka
COMPGEOM
2004
ACM
16 years 3 days ago
A scalable simulator for forest dynamics
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
Sathish Govindarajan, Mike Dietze, Pankaj K. Agarw...