17366 search results - page 343 / 3474 » New Revision Algorithms |
172
click to vote
ACL
2003
15 years 8 months ago
2003
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
202
click to vote
SIMVIS
2003
15 years 8 months ago
2003
The paradigm of the proxel ("probability element") was recently introduced in order to provide a new algorithmic approach to analysing discrete-state stochastic models s...
123
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
165
click to vote
CPM
2009
Springer
15 years 10 months ago
2009
Springer
We present a new efficient algorithm for exact matching in encoded DNA sequences and on binary strings. Our algorithm combines a multi-pattern version of the Bndm algorithm and a s...
180
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...