1329 search results - page 192 / 266 » Randomly Sampling Molecules |
142
Voted
TCOS
2010
15 years 17 days ago
2010
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
137
Voted
IMC
2010
ACM
15 years 3 days ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
120
Voted
JMLR
2010
14 years 9 months ago
2010
Composite likelihood methods provide a wide spectrum of computationally efficient techniques for statistical tasks such as parameter estimation and model selection. In this paper,...
156
Voted
ALT
2011
Springer
14 years 2 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
167
Voted
CRV
2011
IEEE
14 years 2 months ago
2011
IEEE
Abstract—The idea of an online visual vocabulary is proposed. In contrast to the accepted strategy of generating vocabularies offline, using the k-means clustering over all the ...