Sciweavers

2194 search results - page 119 / 439
» Improving HLRTA*( k )
Sort
View
ALGORITHMICA
2005
195views more  ALGORITHMICA 2005»
15 years 1 months ago
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
Heikki Hyyrö, Gonzalo Navarro
ICDM
2010
IEEE
115views Data Mining» more  ICDM 2010»
14 years 11 months ago
Polishing the Right Apple: Anytime Classification Also Benefits Data Streams with Constant Arrival Times
Classification of items taken from data streams requires algorithms that operate in time sensitive and computationally constrained environments. Often, the available time for class...
Jin Shieh, Eamonn J. Keogh
SPEECH
2011
14 years 8 months ago
The importance of phase in speech enhancement
Typical speech enhancement methods, based on the short-time Fourier analysis-modification-synthesis (AMS) framework, modify only the magnitude spectrum and keep the phase spectru...
Kuldip K. Paliwal, Kamil K. Wójcicki, Benja...
CLUSTER
2010
IEEE
14 years 5 months ago
Middleware support for many-task computing
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang,...
ICS
1999
Tsinghua U.
15 years 6 months ago
Adapting cache line size to application behavior
A cache line size has a signi cant e ect on missrate and memorytra c. Today's computers use a xed line size, typically 32B, which may not be optimalfor a given application. O...
Alexander V. Veidenbaum, Weiyu Tang, Rajesh K. Gup...