Sciweavers

2421 search results - page 261 / 485
» Approximate Flow-Aware Networking
Sort
View
IWANN
2005
Springer
15 years 9 months ago
Load Forecasting Using Fixed-Size Least Squares Support Vector Machines
Based on the Nystr¨om approximation and the primal-dual formulation of Least Squares Support Vector Machines (LS-SVM), it becomes possible to apply a nonlinear model to a large sc...
Marcelo Espinoza, Johan A. K. Suykens, Bart De Moo...
ISCAS
2003
IEEE
169views Hardware» more  ISCAS 2003»
15 years 9 months ago
One class of transfer functions with monotonic step response
—The paper describes the transfer functions with monotonic step response. These functions required in design of wide-band pulse amplifiers were synthesized using the first semi-p...
Igor M. Filanovsky
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
15 years 5 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 5 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
NIPS
1994
15 years 5 months ago
Efficient Methods for Dealing with Missing Data in Supervised Learning
We present efficient algorithms for dealing with the problem of missing inputs (incomplete feature vectors) during training and recall. Our approach is based on the approximation ...
Volker Tresp, Ralph Neuneier, Subutai Ahmad