31324 search results - page 6254 / 6265 » Compare |
PODC
2009
ACM
15 years 10 months ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Classification is a core task in knowledge discovery and data mining, and there has been substantial research effort in developing sophisticated classification models. In a parall...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
201
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...