425 search results - page 50 / 85 » On the additive constant of the k-server Work Function Algor... |
SODA
2010
ACM
14 years 5 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
STOC
2010
ACM
14 years 2 days ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
SIGMOD
2006
ACM
14 years 8 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
BMCBI
2005
13 years 7 months ago
2005
Background: The application of high throughput approaches to the identification of protein interactions has offered for the first time a glimpse of the global interactome of some ...
NIPS
2003
13 years 9 months ago
2003
When clustering a dataset, the right number k of clusters to use is often not obvious, and choosing k automatically is a hard algorithmic problem. In this paper we present an impr...