Sciweavers

1257 search results - page 62 / 252
» A generalization of Euler's constant
Sort
View
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
14 years 19 days ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
BMCBI
2010
105views more  BMCBI 2010»
13 years 9 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
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...
Tiejun Cheng, Zhihai Liu, Renxiao Wang
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 3 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
ICRA
2006
IEEE
93views Robotics» more  ICRA 2006»
14 years 2 months ago
Dynamic Features and Prediction Model for Imaging the Fingernail to Measure Fingertip Forces
— As an extension of our previous work on estimating fingertip forces by imaging the fingernail [13], the dynamic features of the coloration response of different parts of the ...
Yu Sun, John M. Hollerbach, Stephen A. Mascaro
STOC
2006
ACM
113views Algorithms» more  STOC 2006»
14 years 2 months ago
Logarithmic hardness of the directed congestion minimization problem
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
Matthew Andrews, Lisa Zhang