Sciweavers

253 search results - page 11 / 51
» Faster Approximation of Distances in Graphs
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
ALGORITHMICA
2011
13 years 2 months ago
Crossing Number and Weighted Crossing Number of Near-Planar Graphs
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
Sergio Cabello, Bojan Mohar
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
13 years 7 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
FUIN
2007
123views more  FUIN 2007»
13 years 7 months ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
JAL
2006
175views more  JAL 2006»
13 years 7 months ago
Approximations for minimum and min-max vehicle routing problems
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
Esther M. Arkin, Refael Hassin, Asaf Levin