Sciweavers

3281 search results - page 339 / 657
» Bases for parametrized iterativity
Sort
View
COLT
2000
Springer
15 years 11 months ago
Barrier Boosting
Boosting algorithms like AdaBoost and Arc-GV are iterative strategies to minimize a constrained objective function, equivalent to Barrier algorithms. Based on this new understandi...
Gunnar Rätsch, Manfred K. Warmuth, Sebastian ...
CRYPTO
2000
Springer
89views Cryptology» more  CRYPTO 2000»
15 years 11 months ago
On the Round Security of Symmetric-Key Cryptographic Primitives
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
Zulfikar Ramzan, Leonid Reyzin
PODS
1999
ACM
153views Database» more  PODS 1999»
15 years 11 months ago
Consistent Query Answers in Inconsistent Databases
In this paper we consider the problem of the logical characterization of the notion of consistent answer in a relational database that may violate given integrity constraints. Thi...
Marcelo Arenas, Leopoldo E. Bertossi, Jan Chomicki
140
Voted
ISSAC
1998
Springer
88views Mathematics» more  ISSAC 1998»
15 years 11 months ago
Multidimensional Chains of Recurrences
A technique to expedite iterative computations which is based on multidimensional chains of recurrences MCR is presented. Algorithms for MCR construction, interpretation and MCR-b...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima
DAC
1996
ACM
15 years 11 months ago
Post-Layout Optimization for Deep Submicron Design
To reduce the number of synthesis and layout iterations, we present a new delay optimization technique, which inserts buers based on back-annotated detailed routing information. D...
Koichi Sato, Masamichi Kawarabayashi, Hideyuki Emu...