Sciweavers

2177 search results - page 381 / 436
» Relative Margin Machines
Sort
View
ALT
2000
Springer
14 years 1 months ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
SIGMETRICS
1999
ACM
14 years 1 months ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia
IPPS
1998
IEEE
14 years 1 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
COLT
1997
Springer
14 years 1 months ago
On-line Learning and the Metrical Task System Problem
We relate two problems that have been explored in two distinct communities. The first is the problem of combining expert advice, studied extensively in the computational learning...
Avrim Blum, Carl Burch
IPPS
1996
IEEE
14 years 29 days ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá