2004 search results - page 171 / 401 » Sampling from large graphs |
108
click to vote
SIGIR
2006
ACM
15 years 9 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
161
Voted
AIPS
2009
15 years 4 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
120
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
125
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Advances in DNA microarray technology portend that molecular signatures from which microarray will eventually be used in clinical environments and personalized medicin...
149
click to vote
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...