Sciweavers

1439 search results - page 55 / 288
» Fast approximation of centrality
Sort
View
CIARP
2004
Springer
14 years 2 months ago
New Bounds and Approximations for the Error of Linear Classifiers
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
Luís G. Rueda
WSCG
2003
136views more  WSCG 2003»
14 years 15 days ago
Piecewise Circular Approximation of Spirals and Polar Polynomials
Spirals are surprisingly common in science, nature, physics, astronomy, flora and fauna, and the arts. In Cartesian coordinates they are typically transcendental functions, which ...
Francesca Taponecco, Marc Alexa
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
13 years 9 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
SIAMNUM
2010
105views more  SIAMNUM 2010»
13 years 5 months ago
Quantization Based Filtering Method Using First Order Approximation
The quantization based filtering method (see [13], [14]) is a grid based approximation method to solve nonlinear filtering problems with discrete time observations. It relies on o...
Afef Sellami
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 5 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...