Sciweavers

5877 search results - page 188 / 1176
» Advanced High Performance Algorithms for Data Processing
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A dynamic approach to the selection of high order n-grams in phonotactic language recognition
Due to computational bounds, most SVM-based phonotactic language recognition systems consider only low-order n-grams (up to n = 3), thus limiting the potential performance of this...
Mikel Peñagarikano, Amparo Varona, Luis Jav...
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
16 years 18 days ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
16 years 1 days ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
PDP
2009
IEEE
16 years 1 months ago
High Throughput Intra-Node MPI Communication with Open-MX
Abstract—The increasing number of cores per node in highperformance computing requires an efficient intra-node MPI communication subsystem. Most existing MPI implementations rel...
Brice Goglin
DEXA
1998
Springer
179views Database» more  DEXA 1998»
15 years 10 months ago
Concurrent Warehouse Maintenance Without Compromising Session Consistency
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...
Michael Teschke, Achim Ulbrich