Sciweavers

2702 search results - page 257 / 541
» Practically Applicable Formal Methods
Sort
View
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 6 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 6 months ago
EWA: exact wiring-sizing algorithm
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
Rony Kay, Gennady Bucheuv, Lawrence T. Pileggi
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 3 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler
UAI
2000
15 years 3 months ago
Feature Selection and Dualities in Maximum Entropy Discrimination
Incorporating feature selection into a classi cation or regression method often carries a number of advantages. In this paper we formalize feature selection speci cally from a dis...
Tony Jebara, Tommi Jaakkola
POPL
2002
ACM
16 years 2 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...