Sciweavers

467 search results - page 84 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
SCOPES
2004
Springer
14 years 4 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
FSTTCS
1993
Springer
14 years 2 months ago
Compact Location Problems
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
Venkatesh Radhakrishnan, Sven Oliver Krumke, Madha...
AIIA
2007
Springer
14 years 2 months ago
Advanced Tree-Based Kernels for Protein Classification
One of the aims of modern Bioinformatics is to discover the molecular mechanisms that rule the protein operation. This would allow us to understand the complex processes involved i...
Elisa Cilia, Alessandro Moschitti
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 9 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
ANTSW
2008
Springer
14 years 26 days ago
Adaptive Particle Swarm Optimization
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
Zhi-hui Zhan, Jun Zhang