Sciweavers

85 search results - page 14 / 17
» Non Uniform Random Walks
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 5 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
JMLR
2010
94views more  JMLR 2010»
13 years 5 months ago
A Rotation Test to Verify Latent Structure
We consider here how to tell whether a latent variable that has been estimated in a multivariate regression context might be real. Often a followup investigation will find a real...
Patrick O. Perry, Art B. Owen
SIGMETRICS
2002
ACM
114views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Search and replication in unstructured peer-to-peer networks
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenke...
CVPR
2005
IEEE
13 years 9 months ago
Dense Photometric Stereo Using Tensorial Belief Propagation
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...
Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
INFOCOM
2011
IEEE
12 years 11 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews