1329 search results - page 53 / 266 » Randomly Sampling Molecules |
105
click to vote
SEMWEB
2007
Springer
15 years 8 months ago
2007
Springer
Recent research on model counting in CNF formulas has shown that a certain sampling method can yield results that are sound with a provably high probability. The key idea is to ite...
129
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
117
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
101
click to vote
ECCV
2002
Springer
16 years 3 months ago
2002
Springer
Sequential random sampling (`Markov Chain Monte-Carlo') is a popular strategy for many vision problems involving multimodal distributions over high-dimensional parameter spac...
126
click to vote
WWW
2005
ACM
16 years 2 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...