1329 search results - page 72 / 266 » Randomly Sampling Molecules |
SIGMOD
2006
ACM
14 years 4 months ago
2006
ACM
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
JAL
2008
13 years 10 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...
MSS
2010
IEEE
13 years 8 months ago
2010
IEEE
The yolk, defined by McKelvey as the smallest ball intersecting all median hyperplanes, is a key concept in the Euclidean spatial model of voting. Koehler conjectured that the yo...
COMPGEOM
1994
ACM
14 years 2 months ago
1994
ACM
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...