Sciweavers

4378 search results - page 240 / 876
» On the Complexity of Ordered Colourings
Sort
View
WIA
1999
Springer
15 years 11 months ago
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing
Finite-state techniques are widely used in various areas of Natural Language Processing (NLP). As Kaplan and Kay [12] have argular expressions are the appropriate level of abstract...
Gertjan van Noord, Dale Gerdemann
CIKM
1998
Springer
15 years 11 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
ITC
1994
IEEE
111views Hardware» more  ITC 1994»
15 years 10 months ago
Simulation Results of an Efficient Defect-Analysis Procedure
For obtaining a zero defect level, a high fault coverage with respect to the stuck-at fault model is often not sufficient as there are many defects that show a more complex behavi...
Olaf Stern, Hans-Joachim Wunderlich
DAC
1994
ACM
15 years 10 months ago
A Modular Partitioning Approach for Asynchronous Circuit Synthesis
Asynchronous circuits are crucial in designing low power and high performance digital systems. In this paper, we present an ecient modular partitioning approach for asynchronous c...
Ruchir Puri, Jun Gu
APSEC
2007
IEEE
15 years 10 months ago
Deriving Software Process Simulation Model from SPEM-based Software Process Model
It is difficult to adopt a simulation technology for simulating a software process because of the difficulty in developing a simulation model. In order to resolve the difficulty, ...
Seunghun Park, KeungSik Choi, Kyung-A Yoon, Doo-Hw...