557 search results - page 80 / 112 » Visualizing Weighted Edges in Graphs |
135
click to vote
GD
1999
Springer
15 years 7 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...
145
Voted
SRDS
2010
IEEE
15 years 1 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...
138
Voted
ICDE
2009
IEEE
15 years 10 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...
152
click to vote
ICCV
2009
IEEE
16 years 6 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...
93
Voted
ICIP
2009
IEEE
16 years 4 months 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...