Sciweavers

874 search results - page 149 / 175
» Faster Algorithms for Semi-Matching Problems
Sort
View
ACL
1997
13 years 10 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
BMCBI
2007
151views more  BMCBI 2007»
13 years 8 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
CORR
2010
Springer
169views Education» more  CORR 2010»
13 years 8 months ago
Spiking Neurons with ASNN Based-Methods for the Neural Block Cipher
Problem statement: This paper examines Artificial Spiking Neural Network (ASNN) which inter-connects group of artificial neurons that uses a mathematical model with the aid of blo...
Saleh Ali K. Al-Omari, Putra Sumari
HPCA
2011
IEEE
13 years 14 days ago
Archipelago: A polymorphic cache design for enabling robust near-threshold operation
Extreme technology integration in the sub-micron regime comes with a rapid rise in heat dissipation and power density for modern processors. Dynamic voltage scaling is a widely us...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...
ICDE
2012
IEEE
237views Database» more  ICDE 2012»
11 years 11 months ago
On Discovery of Traveling Companions from Streaming Trajectories
— The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the pro...
Lu An Tang, Yu Zheng, Jing Yuan, Jiawei Han, Alice...