2152 search results - page 157 / 431 » A Comparative Study of 2QBF Algorithms |
122
click to vote
SPIRE
2007
Springer
15 years 10 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
119
click to vote
COCO
2003
Springer
15 years 9 months ago
2003
Springer
We define and study strong diagonalization and compare it to weak diagonalization, implicit in [7]. Kozen’s result in [7] shows that virtually every separation can be recast as...
155
Voted
KDD
2009
ACM
16 years 5 months ago
2009
ACM
: ? Applying Syntactic Similarity Algorithms for Enterprise Information Management Ludmila Cherkasova, Kave Eshghi, Charles B. Morrey III, Joseph Tucek, Alistair Veitch HP Laborato...
127
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...
146
click to vote
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
—Existing research demonstrated that an effective Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are the two primary vehicles for i...