2310 search results - page 157 / 462 » Coloring Random Graphs |
113
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
141
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
116
Voted
CAIP
1999
Springer
15 years 6 months ago
1999
Springer
We describe an interactive system for content based image retrieval. The system presents the user with 15 randomly selected images from the database. The user grades the images wit...
116
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
111
click to vote
ISCAS
2003
IEEE
15 years 7 months ago
2003
IEEE
Improving testability during the early stages of High-Level Synthesis (HLS) has several benefits, including reduced test hardware overhead, reduced test costs, reduced design iter...