6110 search results - page 439 / 1222 » Approximate Computing |
155
click to vote
EUROPAR
2007
Springer
16 years 1 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
187
click to vote
WAW
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
153
click to vote
ICALP
2005
Springer
16 years 11 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
185
click to vote
ICTCS
2005
Springer
16 years 11 days ago
2005
Springer
Abstract. An extension of the λ-calculus is proposed to study historybased access control. It allows for parametrized security policies with a possibly nested, local scope. To gov...
173
click to vote
ICTCS
2005
Springer
16 years 11 days ago
2005
Springer
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...