2168 search results - page 226 / 434 » Randomized Algorithms and Complexity Theory |
124
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
108
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
158
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Convolutional networks have achieved a great deal of success in high-level vision problems such as object recognition. Here we show that they can also be used as a general method ...
112
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
138
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...