2849 search results - page 242 / 570 » As We Should Have Thought |
280
Voted
ICDE
1998
IEEE
16 years 8 months ago
1998
IEEE
?Past R-tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the...
166
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
176
click to vote
RECOMB
2008
Springer
16 years 7 months ago
2008
Springer
A central challenge in systems biology is the reconstruction of biological networks from high-throughput data sets. A particularly difficult case of this is the inference of dynami...
169
click to vote
ICSE
2004
IEEE-ACM
16 years 7 months ago
2004
IEEE-ACM
To facilitate software maintenance and evolution, a helpful step is to locate features concerned in a particular maintenance task. In the literature, both dynamic and interactive ...
170
click to vote
MOBIHOC
2001
ACM
16 years 6 months ago
2001
ACM
In this paper we consider the following problem for ad hoc networks: assume that n nodes are distributed in a d-dimensional region, with 1d3, and assume that all the nodes have th...