Sciweavers

8298 search results - page 140 / 1660
» On the Complexity of Numerical Analysis
Sort
View
POPL
2009
ACM
16 years 7 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
ECAI
2004
Springer
15 years 11 months ago
Emergence of Complex Networks through Local Optimization
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
Josep M. Pujol, Andreas Flache, Ramon Sangües...
FOCS
2007
IEEE
16 years 21 days ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
BMCBI
2004
98views more  BMCBI 2004»
15 years 6 months ago
STING Millennium Suite: integrated software for extensive analyses of 3d structures of proteins and their complexes
Background: The integration of many aspects of protein/DNA structure analysis is an important requirement for software products in general area of structural bioinformatics. In fa...
Roberto H. Higa, Roberto C. Togawa, Arnaldo J. Mon...
CORR
2012
Springer
249views Education» more  CORR 2012»
14 years 2 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...