Sciweavers

467 search results - page 35 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
VLSID
2005
IEEE
157views VLSI» more  VLSID 2005»
16 years 4 days ago
Energy Efficient Hardware Synthesis of Polynomial Expressions
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
Anup Hosangadi, Farzan Fallah, Ryan Kastner
STOC
2005
ACM
142views Algorithms» more  STOC 2005»
16 years 2 days ago
Market equilibrium via the excess demand function
We consider the problem of computing market equilibria and show three results. (i) For exchange economies satisfying weak gross substitutability we analyze a simple discrete versi...
Bruno Codenotti, Benton McCune, Kasturi R. Varadar...
AUTOMATICA
2006
142views more  AUTOMATICA 2006»
14 years 11 months ago
Stability regions in the parameter space: D-decomposition revisited
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
Elena N. Gryazina, Boris T. Polyak

Publication
307views
15 years 6 months ago
Scale and Rotation Invariant Detection of Singular Patterns in Vector Flow Fields
We present a method for detecting and describing features in vector flow fields. Our method models flow fields locally using a linear combination of complex monomials. These monomi...
Wei Liu, Eraldo Ribeiro
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
14 years 10 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...