486 search results - page 61 / 98 » Parallel Algorithms for Relational Coarsest Partition Proble... |
115
click to vote
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
219
click to vote
VLDB
2003
ACM
16 years 2 months ago
2003
ACM
The Decomposition Storage Model (DSM) vertically partitions all attributes of a given relation. DSM has excellent I/O behavior when the number of attributes touched in the query i...
SKG
2006
IEEE
15 years 8 months ago
2006
IEEE
This article explores the utility of neural network ensembles in knowledge discovery and integration. A novel neural network ensemble model KBNNE (Knowledge-Based Neural Network E...
135
click to vote
CLUSTER
2001
IEEE
15 years 5 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
100
click to vote
ICS
2009
Tsinghua U.
15 years 8 months ago
2009
Tsinghua U.
General purpose programming on the graphics processing units (GPGPU) has received a lot of attention in the parallel computing community as it promises to offer the highest perfo...