425 search results - page 57 / 85 » On the additive constant of the k-server Work Function Algor... |
IPPS
1998
IEEE
14 years 1 hour ago
1998
IEEE
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we demonstrate a practical approach to interaction detection on real data describing the abundance of different species of birds in the prairies east of the souther...
FMCAD
2009
Springer
14 years 2 months ago
2009
Springer
—Given an erroneous design, functional verification returns an error trace exhibiting a mismatch between the specification and the implementation of a design. Automated design ...
VLDB
2001
ACM
14 years 5 days ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...