7006 search results - page 344 / 1402 » Approximation Algorithms |
178
click to vote
FAW
2010
Springer
15 years 4 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
123
click to vote
PVLDB
2008
15 years 3 months ago
2008
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
127
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
124
click to vote
ISLPED
2005
ACM
15 years 9 months ago
2005
ACM
ABSTRACT Motivated by data value locality and quality tolerance present in multimedia applications, we propose a new micro-architecture, Region-level Approximate Computation Buffer...
154
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...