Sciweavers

8824 search results - page 359 / 1765
» On the Complexity of Real Functions
Sort
View
ICFP
2007
ACM
16 years 6 months ago
Termination analysis and call graph construction for higher-order functional programs
The analysis and verification of higher-order programs raises the issue of control-flow analysis for higher-order languages. The problem of constructing an accurate call graph for...
Damien Sereni
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
16 years 4 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
BMCBI
2005
122views more  BMCBI 2005»
15 years 6 months ago
FACT - a framework for the functional interpretation of high-throughput experiments
Background: Interpreting the results of high-throughput experiments, such as those obtained from DNA-microarrays, is an often time-consuming task due to the high number of data-po...
Felix Kokocinski, Nicolas Delhomme, Gunnar Wrobel,...
TSP
2008
123views more  TSP 2008»
15 years 6 months ago
MIMO Radar Space-Time Adaptive Processing Using Prolate Spheroidal Wave Functions
In the traditional transmitting beamforming radar system, the transmitting antennas send coherent waveforms which form a highly focused beam. In the multiple-input multipleoutput (...
Chun-Yang Chen, Palghat P. Vaidyanathan
BLISS
2009
IEEE
15 years 8 months ago
Autonomous Physical Secret Functions and Clone-Resistant Identification
Self configuring VLSI technology architectures offer a new environment for creating novel security functions. Two such functions for physical security architectures are proposed t...
Wael Adi