425 search results - page 37 / 85 » Polynomial Time Data Reduction for Dominating Set |
122
Voted
FOCS
2000
IEEE
15 years 1 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
187
click to vote
STOC
2012
ACM
12 years 12 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...
75
Voted
CCGRID
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
BMCBI
2008
14 years 9 months ago
2008
Background: Survival time is an important clinical trait for many disease studies. Previous works have shown certain relationship between patients' gene expression profiles a...
HPDC
2008
IEEE
14 years 9 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...