Sciweavers

6568 search results - page 272 / 1314
» Reducing the Complexity of Reductions
Sort
View
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
16 years 26 days ago
Parallel Repetition of Computationally Sound Protocols Revisited
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...
Krzysztof Pietrzak, Douglas Wikström
ICPR
2000
IEEE
16 years 7 months ago
A Modification of Eigenvalues to Compensate Estimation Errors of Eigenvectors
In statistical pattern recognition, parameters of distributions are usually estimated from training samples. It is well known that shortage of training samples causes estimation e...
Masakazu Iwamura, Shinichiro Omachi, Hirotomo Aso
HAPTICS
2009
IEEE
15 years 10 months ago
Computationally efficient techniques for data-driven haptic rendering
Data-driven haptic rendering requires processing of raw recorded signals, which leads to high computational effort for large datasets. To achieve real-time performance, one possib...
Raphael Höver, Massimiliano Di Luca, Gá...
WSC
2008
15 years 9 months ago
Simulation analysis of semiconductor manufacturing with small lot size and batch tool replacements
Long cycle times in semiconductor manufacuring represent an increasing challenge for the industry and lead to a growing need of break-through approaches to reduce it. Small lot si...
Kilian Schmidt, Oliver Rose
MFCS
2004
Springer
16 years 3 days ago
Approximating Boolean Functions by OBDDs
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
Andre Gronemeier