2079 search results - page 134 / 416 » Universality of random graphs |
184
click to vote
PAMI
2010
14 years 11 months ago
2010
We present a new method for blind document bleed through removal based on separate Markov Random Field (MRF) regularization for the recto and for the verso side, where separate pri...
115
Voted
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
179
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
148
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
: Spin-Torque Transfer Magnetic RAM (STT MRAM) is a promising candidate for future universal memory. It combines the desirable attributes of current memory technologies such as SRA...
151
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...