Sciweavers

835 search results - page 24 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 4 months ago
Region Sampling: Continuous Adaptive Sampling on Sensor Networks
Abstract— Satisfying energy constraints while meeting performance requirements is a primary concern when a sensor network is being deployed. Many recent proposed techniques offer...
Song Lin, Benjamin Arai, Dimitrios Gunopulos, Gaut...
ICDCS
2007
IEEE
14 years 2 months ago
Efficient Execution of Continuous Incoherency Bounded Queries over Multi-Source Streaming Data
On-line decision making often involves query processing over time-varying data which arrives in the form of data streams from distributed locations. In such environments typically...
Manish Bhide, Krithi Ramamritham, Mukund Agrawal
TIP
2008
154views more  TIP 2008»
13 years 10 months ago
Adaptive Local Linear Regression With Application to Printer Color Management
Abstract--Local learning methods, such as local linear regression and nearest neighbor classifiers, base estimates on nearby training samples, neighbors. Usually, the number of nei...
Maya R. Gupta, Eric K. Garcia, E. Chin
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 2 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 10 months ago
Structured sparsity-inducing norms through submodular functions
Sparse methods for supervised learning aim at finding good linear predictors from as few variables as possible, i.e., with small cardinality of their supports. This combinatorial ...
Francis Bach