Sciweavers

387 search results - page 12 / 78
» Many Random Walks Are Faster Than One
Sort
View
ECCV
2008
Springer
14 years 11 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
13 years 10 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
DAIS
2011
13 years 15 days ago
Gozar: NAT-Friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) c...
Amir H. Payberah, Jim Dowling, Seif Haridi
ICDM
2003
IEEE
126views Data Mining» more  ICDM 2003»
14 years 2 months ago
Interpretations of Association Rules by Granular Computing
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
Yuefeng Li, Ning Zhong
ITC
1997
IEEE
80views Hardware» more  ITC 1997»
14 years 1 months ago
Scan Synthesis for One-Hot Signals
Tri-state buses and pass transistor logic are used in many complex applications to achieve high performance and small area. Such circuits often contain logic requiring one-hot sig...
Subhasish Mitra, LaNae J. Avra, Edward J. McCluske...