Sciweavers

492 search results - page 94 / 99
» Fast data stream algorithms using associative memories
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
High Performance Linear Algebra Package LAPACK90
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
Jack Dongarra, Jerzy Wasniewski
MST
2002
128views more  MST 2002»
13 years 7 months ago
A Simple and Efficient Parallel Disk Mergesort
External sorting--the process of sorting a file that is too large to fit into the computer's internal memory and must be stored externally on disks--is a fundamental subroutin...
Rakesh D. Barve, Jeffrey Scott Vitter
KDD
2001
ACM
145views Data Mining» more  KDD 2001»
14 years 8 months ago
Proximal support vector machine classifiers
Given a dataset, each element of which labeled by one of k labels, we construct by a very fast algorithm, a k-category proximal support vector machine (PSVM) classifier. Proximal s...
Glenn Fung, Olvi L. Mangasarian
IJRR
2010
185views more  IJRR 2010»
13 years 6 months ago
FISST-SLAM: Finite Set Statistical Approach to Simultaneous Localization and Mapping
The solution to the problem of mapping an environment and at the same time using this map to localize (the simultaneous localization and mapping, SLAM, problem) is a key prerequis...
Bharath Kalyan, K. W. Lee, W. Sardha Wijesoma
WDAG
2005
Springer
104views Algorithms» more  WDAG 2005»
14 years 1 months ago
Polymorphic Contention Management
Abstract. In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same memory locations. Whereas atomicity and ser...
Rachid Guerraoui, Maurice Herlihy, Bastian Pochon