379 search results - page 42 / 76 » The Graham-Knowlton Problem Revisited |
TCC
2012
Springer
12 years 3 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have opt...
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
AMW
2010
13 years 9 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
AIL
2002
13 years 7 months ago
2002
: In this paper I recapitulate the ideas of Berman and Hafner (1993) regarding the role of teleology in legal argument. I show how these ideas can be used to address some issues ar...