6105 search results - page 821 / 1221 » A Parallel Algorithm for Bound-Smoothing |
194
click to vote
DATAMINE
2000
15 years 6 months ago
2000
Data mining on large data warehouses is becoming increasingly important. In support of this trend, we consider a spectrum of architectural alternatives for coupling mining with da...
205
click to vote
ESWA
2010
15 years 5 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...
201
click to vote
JCO
2010
15 years 5 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
205
click to vote
PE
2010
Springer
15 years 5 months ago
2010
Springer
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
241
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...