Sciweavers

298 search results - page 17 / 60
» Abstract Fixpoint Computations with Numerical Acceleration M...
Sort
View
ICC
2008
IEEE
118views Communications» more  ICC 2008»
14 years 1 months ago
Bounded-Variance Network Calculus: Computation of Tight Approximations of End-to-End Delay
Abstract ⎯ Currently, the most advanced framework for stochastic network calculus is the min-plus algebra, providing bounds for the end-to-end delay in networks. The bounds calcu...
Paolo Giacomazzi, Gabriella Saddemi
AAAI
2004
13 years 8 months ago
QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems
Over-constrained problems can have an exponential number of conflicts, which explain the failure, and an exponential number of relaxations, which restore the consistency. A user o...
Ulrich Junker
SIAMSC
2008
127views more  SIAMSC 2008»
13 years 7 months ago
Fast (Structured) Newton Computations
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
Thomas F. Coleman, Wei Xu
ICCSA
2004
Springer
14 years 24 days ago
Reverse Subdivision Multiresolution for Polygonal Silhouette Error Correction
Abstract. This paper presents a method for automatic removal of artifacts that appear in silhouettes extracted from polygonal meshes due to the discrete nature of meshes and numeri...
Kevin Foster, Mario Costa Sousa, Faramarz F. Samav...
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
14 years 1 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri