206 search results - page 38 / 42 » Constant factor approximation algorithm for the knapsack med... |
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
ADHOCNOW
2010
Springer
13 years 5 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Estimating frequency moments and Lp distances are well studied problems in the adversarial data stream model and tight space bounds are known for these two problems. There has been...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...