2799 search results - page 401 / 560 » computing 1998 |
121
click to vote
JCSS
1998
15 years 4 months ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
172
click to vote
PC
1998
15 years 4 months ago
1998
We describe Javaflow and Paraflow, the client and server parts of a digital library, providing high-performance data-retrieval and data-mining services, with emphasis on user in...
147
click to vote
SIGMOD
1998
ACM
15 years 4 months ago
1998
ACM
Abstract: Decision support systems (DSS) and data warehousing workloads comprise an increasing fraction of the database market today. I/O capacity and associated processing require...
140
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
196
click to vote
STACS
2012
Springer
14 years 12 days ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...