Sciweavers

400 search results - page 41 / 80
» An Evaluation of the WPE Algorithm Using Tangent Distance
Sort
View
TIFS
2008
157views more  TIFS 2008»
14 years 9 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
VIS
2007
IEEE
235views Visualization» more  VIS 2007»
15 years 11 months ago
Efficient Surface Reconstruction using Generalized Coulomb Potentials
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
Andrei C. Jalba, Jos B. T. M. Roerdink
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
15 years 9 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
WWW
2007
ACM
15 years 10 months ago
Robust web page segmentation for mobile terminal using content-distances and page layout information
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...
Gen Hattori, Keiichiro Hoashi, Kazunori Matsumoto,...
BMCBI
2006
92views more  BMCBI 2006»
14 years 10 months ago
Recrafting the neighbor-joining method
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
Thomas Mailund, Gerth Stølting Brodal, Rolf...