4843 search results - page 326 / 969 » The Shortcut Problem - Complexity and Approximation |
133
click to vote
RECOMB
2010
Springer
15 years 11 months ago
2010
Springer
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
138
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
126
click to vote
EOR
2006
15 years 4 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...
141
Voted
TKDE
2010
15 years 2 months ago
2010
—Bloom filter is effective, space-efficient data structure for concisely representing a data set and supporting approximate membership queries. Traditionally, researchers often b...
169
click to vote
MMAS
2010
Springer
14 years 11 months ago
2010
Springer
The mean first passage time (MFPT) is calculated for a Brownian particle in a bounded two-dimensional domain that contains N small nonoverlapping absorbing windows on its boundary....