Sciweavers

1190 search results - page 148 / 238
» On the Structure of Syntenic Distance
Sort
View
EPIA
2009
Springer
14 years 3 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
FGIT
2009
Springer
14 years 3 months ago
Object Surface Reconstruction from One Camera System
In this paper, there is introduced an approach to surface reconstruction of an object captured by one grayscale camera with a small resolution. The proposed solution expects a rec...
Radim Dvorak, Martin Drahanský, Filip Ors&a...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 3 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
ICAPR
2009
Springer
14 years 3 months ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri
ICPR
2008
IEEE
14 years 3 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...