1538 search results - page 121 / 308 » Spectral Techniques in Graph Algorithms |
110
click to vote
AVI
2006
15 years 2 months ago
2006
This methodological note focuses on the edge density of real world examples of networks. The edge density is a parameter of interest typically when putting up user studies in an e...
167
click to vote
CRV
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a novel method for the automatic segmentation of a foreground layer from a natural scene in real time by fusing infrared, color and edge information. Thi...
INFOCOM
2009
IEEE
15 years 8 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
107
click to vote
IICS
2003
Springer
15 years 6 months ago
2003
Springer
Both human users and crawlers face the problem of finding good start pages to explore some topic. We show how to assist in qualifying pages as start nodes by link-based ranking al...
133
click to vote
HPCC
2005
Springer
15 years 7 months ago
2005
Springer
Structured data represented in the form of graphs arises in several fields of the science and the growing amount of available data makes distributed graph mining techniques partic...