562 search results - page 62 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
MLCW
2005
Springer
15 years 3 months ago
2005
Springer
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—We consider a widely applicable model of resource allocation where two sequences of events are coupled: on a continuous time axis (t), network dynamics evolve over time. On a di...
FUIN
2008
14 years 9 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
BMCBI
2010
14 years 9 months ago
2010
Background: The ability to design thermostable proteins is theoretically important and practically useful. Robust and accurate algorithms, however, remain elusive. One critical pr...