Sciweavers

3204 search results - page 163 / 641
» The Alcuin Number of a Graph
Sort
View
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 8 months ago
A characterization of b-perfect graphs
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
Chính T. Hoàng, Frédér...
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 8 months ago
Observable Graphs
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
Raphael M. Jungers, Vincent D. Blondel
CVPR
2003
IEEE
14 years 10 months ago
Object Segmentation Using Graph Cuts Based Active Contours
In this paper we present a graph cuts based active contours (GCBAC) approach to object segmentation problems. Our method is a combination of active contours and the optimization t...
Ning Xu, Ravi Bansal, Narendra Ahuja
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
14 years 9 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...