Sciweavers

9532 search results - page 179 / 1907
» Logic, Graphs, and Algorithms
Sort
View
JGAA
2000
179views more  JGAA 2000»
15 years 4 months ago
Approximation Algorithms for Some Graph Partitioning Problems
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
George He, Jiping Liu, Cheng Zhao
APVIS
2007
15 years 6 months ago
A comparison of vertex ordering algorithms for large graph visualization
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationsh...
Christopher Mueller, Benjamin Martin, Andrew Lumsd...
ICIP
2007
IEEE
15 years 10 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
ICDE
2002
IEEE
121views Database» more  ICDE 2002»
16 years 5 months ago
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
Sergey Melnik, Hector Garcia-Molina, Erhard Rahm
CADE
1992
Springer
15 years 8 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne