Sciweavers

3475 search results - page 59 / 695
» Backbones in Optimization and Approximation
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
Alexander Kolesnikov
CAGD
2007
65views more  CAGD 2007»
13 years 10 months ago
Progressive iterative approximation and bases with the fastest convergence rates
All normalized totally positive bases satisfy the progressive iterative approximation property. The normalized B-basis has optimal shape preserving properties and we prove that it...
Jorge Delgado, Juan Manuel Peña
SIGCOMM
2004
ACM
14 years 3 months ago
Sizing router buffers
All Internet routers contain buffers to hold packets during times of congestion. Today, the size of the buffers is determined by the dynamics of TCP’s congestion control algor...
Guido Appenzeller, Isaac Keslassy, Nick McKeown
SIGMOD
2003
ACM
172views Database» more  SIGMOD 2003»
14 years 10 months ago
Dynamic Sample Selection for Approximate Query Processing
In decision support applications, the ability to provide fast approximate answers to aggregation queries is desirable. One commonly-used technique for approximate query answering ...
Brian Babcock, Surajit Chaudhuri, Gautam Das
AAAI
2006
13 years 11 months ago
Learning Basis Functions in Hybrid Domains
Markov decision processes (MDPs) with discrete and continuous state and action components can be solved efficiently by hybrid approximate linear programming (HALP). The main idea ...
Branislav Kveton, Milos Hauskrecht