Sciweavers

1397 search results - page 159 / 280
» On the Need for Practical Formal Methods
Sort
View
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
15 years 9 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...
176
Voted
ISPD
1997
ACM
186views Hardware» more  ISPD 1997»
15 years 8 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
AMT
2010
Springer
269views Multimedia» more  AMT 2010»
15 years 6 months ago
User Interests: Definition, Vocabulary, and Utilization in Unifying Search and Reasoning
Abstract. Consistent description and representation method of user interests are required for personalized Web applications. In this paper, we provide a formal definition and the &...
Yi Zeng, Yan Wang, Zhisheng Huang, Danica Damljano...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 5 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 5 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