Sciweavers

1022 search results - page 115 / 205
» Logspace Complexity of Functions and Structures
Sort
View
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
ICPR
2004
IEEE
15 years 11 months ago
Efficient Calculation of the Complete Optimal Classification Set
Feature and structure selection is an important part of many classification problems. In previous papers, an approach called basis pursuit classification has been proposed which p...
Martin Brown, Nicholas Costen, Shigeru Akamatsu
ICPR
2000
IEEE
15 years 11 months ago
Detecting Rotational Symmetries Using Normalized Convolution
Perceptual experiments indicate that corners and curvature are very important features in the process of recognition. This paper presents a new method to detect rotational symmetr...
Björn Johansson, Gösta H. Granlund, Hans...
CAV
2009
Springer
137views Hardware» more  CAV 2009»
15 years 10 months ago
VS3: SMT Solvers for Program Verification
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
Saurabh Srivastava, Sumit Gulwani, Jeffrey S. Fost...
ICCD
2004
IEEE
97views Hardware» more  ICCD 2004»
15 years 6 months ago
A General Post-Processing Approach to Leakage Current Reduction in SRAM-Based FPGAs
A negative effect of ever-shrinking supply and threshold voltages is the larger percentage of total power consumption that comes from leakage current. Several techniques have been...
John Lach, Jason Brandon, Kevin Skadron