2638 search results - page 378 / 528 » Random Geometric Complexes |
149
Voted
DAC
2005
ACM
16 years 3 months ago
2005
ACM
The challenge of verifying a modern microprocessor design is an overwhelming one: Increasingly complex micro-architectures combined with heavy time-to-market pressure have forced ...
149
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
: ? Improving Clustering Stability with Combinatorial MRFs Bekkerman, Ron; Scholz, Martin; Viswanathan, Krishnamurthy HP Laboratories HPL-2009-46 Clustering stability, combinatoria...
176
Voted
ECCV
2008
Springer
16 years 22 days ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
118
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veri...
108
Voted
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...