Sciweavers

1951 search results - page 210 / 391
» An algorithm for improving graph partitions
Sort
View
ICIP
2005
IEEE
16 years 7 months ago
Exploiting discriminant information in elastic graph matching
In this paper, we investigate the use of discriminant techniques in the elastic graph matching (EGM) algorithm. First we use discriminant analysis in the feature vectors of the no...
Stefanos Zafeiriou, Anastasios Tefas, Ioannis Pita...
COMPGEOM
2004
ACM
15 years 11 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi
IPPS
2002
IEEE
15 years 10 months ago
Toward Optimal Diffusion Matrices
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...
Robert Elsässer, Burkhard Monien, Günter...
ICIP
2007
IEEE
15 years 12 months ago
Compression Optimized Tracing of Digital Curves using Graph Theory
The use of an alphabet of line segments to compose a curve is a possible approach for curve data compression. An existing state-of-the-art method considers a quadtree decompositio...
András Hajdu, Ioannis Pitas
161
Voted
ICWE
2005
Springer
15 years 11 months ago
Automatic Optimization of Web Recommendations Using Feedback and Ontology Graphs
Abstract. Web recommendation systems have become a popular means to improve the usability of web sites. This paper describes the architecture of a rulebased recommendation system a...
Nick Golovin, Erhard Rahm