434 search results - page 63 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
VLDB
2000
ACM
15 years 1 months ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
ICDCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Network coding has been a prominent approach to a series of problems that used to be considered intractable with traditional transmission paradigms. Recent work on network coding ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...
84
Voted
ANOR
2005
14 years 9 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
IJCAI
2003
14 years 11 months ago
2003
We investigate the problem of non-covariant behavior of policy gradient reinforcement learning algorithms. The policy gradient approach is amenable to analysis by information geom...