Sciweavers

2593 search results - page 99 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
IWOMP
2009
Springer
15 years 7 months ago
Dynamic Task and Data Placement over NUMA Architectures: An OpenMP Runtime Perspective
Abstract. Exploiting the full computational power of current hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-...
François Broquedis, Nathalie Furmento, Bric...
106
Voted
SAC
2010
ACM
15 years 7 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...
ICML
2000
IEEE
16 years 3 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
112
Voted
KDD
1999
ACM
185views Data Mining» more  KDD 1999»
15 years 7 months ago
User-Driven Navigation Pattern Discovery from Internet Data
Managers of electronic commerce sites need to learn as much as possible about their customers and those browsing their virtual premises, in order to maximise the return on marketin...
Matthias Baumgarten, Alex G. Büchner, Sarabjo...
112
Voted
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 6 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...