1007 search results - page 199 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
KDD
2006
ACM
15 years 9 months ago
2006
ACM
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
BMCBI
2008
14 years 9 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
ICDCN
2009
Springer
15 years 4 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
ESWA
2010
14 years 8 months ago
2010
Aiming at robust spoken dialogue interaction in motorcycle environment, we investigate various configurations for a speech front-end, which consists of speech pre-processing, spee...
ICS
2009
Tsinghua U.
15 years 2 months ago
2009
Tsinghua U.
Modern GPUs offer much computing power at a very modest cost. Even though CUDA and other related recent developments are accelerating the use of GPUs for general purpose applicati...