715 search results - page 59 / 143 » On graphs with subgraphs having large independence numbers |
WAW
2004
Springer
15 years 5 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
91
Voted
DEXA
2004
Springer
15 years 5 months ago
2004
Springer
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
105
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
VIZSEC
2005
Springer
15 years 5 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...