684 search results - page 88 / 137 » On embedding well-separable graphs |
252
click to vote
USS
2010
15 years 4 months ago
2010
A key feature that distinguishes modern botnets from earlier counterparts is their increasing use of structured overlay topologies. This lets them carry out sophisticated coordina...
205
click to vote
WADS
2001
Springer
15 years 11 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
160
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
172
click to vote
EUROCOLT
1995
Springer
15 years 10 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
141
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We introduce a novel topological formulation for contour grouping. Our grouping criterion, called untangling cycles, exploits the inherent topological 1D structure of salient cont...