4865 search results - page 151 / 973 » The Complexity of Graph Connectivity |
ICCV
2009
IEEE
15 years 3 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
PLDI
2004
ACM
14 years 4 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
FOCS
2005
IEEE
14 years 4 months ago
2005
IEEE
We establish a new connection between the two most common traditions in the theory of real computation, the Blum-Shub-Smale model and the Computable Analysis approach. We then use...
WEA
2010
Springer
14 years 5 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
102
click to vote
ICDE
2002
IEEE
15 years 4 days ago
2002
IEEE
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...