Sciweavers

495 search results - page 12 / 99
» Data exchange: computing cores in polynomial time
Sort
View
STACS
2010
Springer
14 years 1 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf
ITC
2002
IEEE
94views Hardware» more  ITC 2002»
13 years 11 months ago
Techniques to Reduce Data Volume and Application Time for Transition Test
1 Scan based transition tests are added to improve the detection of speed failures using scan tests. Empirical data suggests that both data volume and application time, for transi...
Xiao Liu, Michael S. Hsiao, Sreejit Chakravarty, P...
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
14 years 7 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
TC
2010
13 years 1 months ago
Reconfigurable Hardware Implementations of Tweakable Enciphering Schemes
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...
Cuauhtemoc Mancillas-López, Debrup Chakrabo...
SDM
2009
SIAM
144views Data Mining» more  SDM 2009»
14 years 3 months ago
CORE: Nonparametric Clustering of Large Numeric Databases.
Current clustering techniques are able to identify arbitrarily shaped clusters in the presence of noise, but depend on carefully chosen model parameters. The choice of model param...
Andrej Taliun, Arturas Mazeika, Michael H. Bö...