Sciweavers

7129 search results - page 224 / 1426
» Approximation Algorithms for Treewidth
Sort
View
244
Voted
CODCRY
2011
Springer
247views Cryptology» more  CODCRY 2011»
14 years 7 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
Daniel J. Bernstein
PAMI
2012
13 years 6 months ago
Image Signature: Highlighting Sparse Salient Regions
—We introduce a simple image descriptor referred to as the image signature. We show, within the theoretical framework of sparse signal mixing, that this quantity spatially approx...
Xiaodi Hou, Jonathan Harel, Christof Koch
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 4 months ago
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
Christopher Y. Crutchfield, Zoran Dzunic, Jeremy T...
134
Voted
HICSS
2002
IEEE
132views Biometrics» more  HICSS 2002»
15 years 9 months ago
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
117
Voted
DAC
2009
ACM
16 years 5 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...