4066 search results - page 183 / 814 » Almost Complete Sets |
158
click to vote
JCC
2006
15 years 6 months ago
2006
: We describe the implementation of a general and flexible Monte Carlo (MC) module for the program CHARMM, which is used widely for modeling biomolecular systems with empirical ene...
138
click to vote
JEI
2006
15 years 6 months ago
2006
Abstract. We investigate the performance of state of the art universal steganalyzers proposed in the literature. These universal steganalyzers are tested against a number of well-k...
188
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
169
click to vote
COMGEO
1998
ACM
15 years 6 months ago
1998
ACM
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
217
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...