Sciweavers

3875 search results - page 409 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 7 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
FOCM
2007
76views more  FOCM 2007»
15 years 6 months ago
Risk Bounds for Random Regression Graphs
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
Andrea Caponnetto, Steve Smale
PAMI
2010
119views more  PAMI 2010»
15 years 5 months ago
Efficient Multilevel Eigensolvers with Applications to Data Analysis Tasks
—Multigrid solvers proved very efficient for solving massive systems of equations in various fields. These solvers are based on iterative relaxation schemes together with the app...
Dan Kushnir, Meirav Galun, Achi Brandt
SEAL
2010
Springer
15 years 4 months ago
Dominance-Based Pareto-Surrogate for Multi-Objective Optimization
Abstract. Mainstream surrogate approaches for multi-objective problems build one approximation for each objective. Mono-surrogate approaches instead aim at characterizing the Paret...
Ilya Loshchilov, Marc Schoenauer, Michèle S...
ICASSP
2011
IEEE
14 years 10 months ago
Dynamic spectrum management in DSL with asynchronous crosstalk
Dynamic spectrum management (DSM) aims to optimally allocate per-user transmit spectra so that the effect of multiuser interference (crosstalk) is minimized and the capabilities o...
Rodrigo B. Moraes, Paschalis Tsiaflakis, Marc Moon...