557 search results - page 80 / 112 » Visualizing Weighted Edges in Graphs |
92
Voted
GD
1999
Springer
15 years 3 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
103
click to vote
SRDS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...
100
Voted
ICDE
2009
IEEE
15 years 5 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
105
click to vote
ICCV
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper we propose a novel computational method to infer visual saliency in images. The method is based on the idea that salient objects should have local characteristics tha...
ICIP
2009
IEEE
16 years 4 days ago
2009
IEEE
In this paper, we propose a color image enhancement method that uses retinex with a robust envelope to improve the visual appearance of an image. The word "retinex" is h...