Sciweavers

1446 search results - page 120 / 290
» Testing for Concise Representations
Sort
View
SAT
2009
Springer
126views Hardware» more  SAT 2009»
14 years 4 months ago
Extending SAT Solvers to Cryptographic Problems
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
Mate Soos, Karsten Nohl, Claude Castelluccia
IROS
2008
IEEE
129views Robotics» more  IROS 2008»
14 years 4 months ago
Recognizing texture and hardness by touch
Abstract— We have experimented with different neural network based architectures for bio-inspired self-organizing texture and hardness perception systems. To this end we have dev...
Magnus Johnsson, Christian Balkenius
ISMIR
2004
Springer
115views Music» more  ISMIR 2004»
14 years 3 months ago
Timbre Classification Of A Single Musical Instrument
In order to map the spectral characteristics of the large variety of sounds a musical instrument may produce, different notes were performed and sampled in several intensity level...
Mauricio A. Loureiro, Hugo B. De Paula, Hani C. Ye...
AIME
2001
Springer
14 years 2 months ago
Using Critiquing for Improving Medical Protocols: Harder than It Seems
Medical protocols are widely recognised to provide clinicians with high-quality and up-to-date recommendations. A critical condition for this is of course that the protocols themse...
Mar Marcos, Geert Berger, Frank van Harmelen, Anne...
STACS
2001
Springer
14 years 2 months ago
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
Philipp Woelfel