Sciweavers

1100 search results - page 39 / 220
» Approximate distance oracles
Sort
View
DAM
2006
136views more  DAM 2006»
14 years 10 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen
CPM
1999
Springer
129views Combinatorics» more  CPM 1999»
15 years 2 months ago
On the Structure of Syntenic Distance
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
David Liben-Nowell
CVPR
2008
IEEE
15 years 12 months ago
A joint appearance-spatial distance for kernel-based image categorization
The goal of image categorization is to classify a collection of unlabeled images into a set of predefined classes to support semantic-level image retrieval. The distance measures ...
Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Jinhui Tang,...
EMMCVPR
2011
Springer
13 years 9 months ago
The Complex Wave Representation of Distance Transforms
The complex wave representation (CWR) converts unsigned 2D distance transforms into their corresponding wave functions. The underlying motivation for performing this maneuver is as...
Karthik S. Gurumoorthy, Anand Rangarajan, Arunava ...
GD
2006
Springer
15 years 1 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele