Sciweavers

780 search results - page 18 / 156
» Cost-Sharing Approximations for h
Sort
View
CIE
2010
Springer
14 years 4 days ago
Approximate Self-assembly of the Sierpinski Triangle
The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree ex...
Jack H. Lutz, Brad Shutters
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 7 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
ANCS
2010
ACM
13 years 4 months ago
A traffic-aware top-N firewall ruleset approximation algorithm
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...
Ho-Yu Lam, Donghan (Jarod) Wang, H. Jonathan Chao
ICASSP
2011
IEEE
12 years 11 months ago
Compressive sampling with a successive approximation ADC architecture
This paper proposes a compressive sampling scheme based on random temporal sampling using a successive approximation register (SAR) ADC architecture. Variable wordlength data samp...
Chenchi Luo, James H. McClellan
ICIP
1999
IEEE
14 years 9 months ago
The Sinc-Approximating Kernels of Classical Polynomial Interpolation
A classical approach to interpolation of sampled data is polynomial interpolation. However, from the sampling theorem it follows that the ideal approach to interpolation is to con...
Erik H. W. Meijering, Wiro J. Niessen, Max A. Vier...