Sciweavers

5580 search results - page 154 / 1116
» Randomized priority algorithms
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
TVCG
2011
136views more  TVCG 2011»
14 years 4 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai
PODC
2009
ACM
15 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
CORR
2008
Springer
103views Education» more  CORR 2008»
14 years 10 months ago
Generating Random Graphs with Large Girth
We present a simple and efficient algorithm for randomly generating simple graphs without small cycles. These graphs can be used to design high performance Low-Density Parity-Chec...
Mohsen Bayati, Andrea Montanari, Amin Saberi
SIGKDD
2002
93views more  SIGKDD 2002»
14 years 9 months ago
Randomization in Privacy-Preserving Data Mining
Suppose there are many clients, each having some personal information, and one server, which is interested only in aggregate, statistically significant, properties of this informa...
Alexandre V. Evfimievski