2796 search results - page 106 / 560 » The coolest path problem |
155
Voted
IMC
2006
ACM
15 years 11 months ago
2006
ACM
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
136
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
195
click to vote
ICCV
2011
IEEE
14 years 5 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...
137
Voted
CIAC
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
141
click to vote
CIKM
2007
Springer
15 years 11 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...