10304 search results - page 2060 / 2061 » Computer science with the sciences: an emphasis in computati... |
FCT
2009
Springer
13 years 11 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
SAC
2004
ACM
13 years 10 months ago
2004
ACM
A popular solution to internet performance problems is the widespread caching of data. Many caching algorithms have been proposed in the literature, most attempting to optimize fo...
ICCAD
2003
IEEE
13 years 10 months ago
2003
IEEE
This paper presents several important enhancements to the recently published multilevel placement package mPL [12]. The improvements include (i) unconstrained quadratic relaxation...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonove...