Sciweavers

1007 search results - page 172 / 202
» The Complexity of Futile Questioning
Sort
View
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Primitive words and roots of words
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
Gerhard Lischke
INFOCOM
2011
IEEE
12 years 11 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
BMCBI
2006
104views more  BMCBI 2006»
13 years 7 months ago
SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools
Background: Deluged by the rate and complexity of completed genomic sequences, the need to align longer sequences becomes more urgent, and many more tools have thus been developed...
Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Ch...
CVPR
2008
IEEE
14 years 9 months ago
Spatio-temporal Saliency detection using phase spectrum of quaternion fourier transform
Salient areas in natural scenes are generally regarded as the candidates of attention focus in human eyes, which is the key stage in object detection. In computer vision, many mod...
Chenlei Guo, Qi Ma, Liming Zhang
DAC
2009
ACM
14 years 8 months ago
Multicore parallel min-cost flow algorithm for CAD applications
Computational complexity has been the primary challenge of many VLSI CAD applications. The emerging multicore and manycore microprocessors have the potential to offer scalable perf...
Yinghai Lu, Hai Zhou, Li Shang, Xuan Zeng