Sciweavers

1518 search results - page 41 / 304
» Exact and Approximate Bandwidth
Sort
View
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
13 years 9 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
COLCOM
2007
IEEE
13 years 11 months ago
A random projection approach to subscription covering detection in publish/subscribe systems
Abstract—Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large se...
Duc A. Tran, Thinh Nguyen
VLSID
2004
IEEE
111views VLSI» more  VLSID 2004»
14 years 10 months ago
On Buffering Schemes for Long Multi-Layer Nets
We consider the problem of minimizing the delay in signal transmission over point-to-point connections across multiple metal layers in a VLSI circuit. We present an exact solution...
Vani Prasad, Madhav P. Desai
DEBU
2000
118views more  DEBU 2000»
13 years 9 months ago
Matching Algorithms within a Duplicate Detection System
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
Alvaro E. Monge
DAC
2006
ACM
14 years 10 months ago
Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming
In this paper, we propose an exact algorithm for the problem of area optimization under a delay constraint in the synthesis of multiplierless FIR filters. To the best of our knowl...
Eduardo A. C. da Costa, José Monteiro, Leve...