412 search results - page 12 / 83 » A New Proof of the F5 Algorithm |
DAC
2006
ACM
15 years 3 months ago
2006
ACM
How can design teams employ new tools and develop response methodologies yet still stay within design budgets? How much effort does it require to be an early adopter and what kind...
COCO
2007
Springer
15 years 3 months ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
126
click to vote
STOC
2012
ACM
13 years 5 days ago
2012
ACM
We obtain a characterization of feasible, Bayesian, multi-item multi-bidder mechanisms with independent, additive bidders as distributions over hierarchical mechanisms. Combined w...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
1 : Logic in Specification and Verification (abstract) Natarajan Shankar (SRI) Session Chair : Sungdeok Cha 12 : 00 13 : 00 Lunch 13 : 00 15 : 00 2 : Boolean Modeling of Cell Biolo...
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...