1199 search results - page 62 / 240 » Graph Theory |
119
Voted
COLT
2005
Springer
15 years 9 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
104
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...
122
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
121
Voted
ATMOS
2010
15 years 2 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
150
Voted
HT
2010
ACM
15 years 5 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...