Sciweavers

2969 search results - page 444 / 594
» A space efficient algorithm for group structure computation
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
Robust Piecewise-Planar 3D Reconstruction and Completion from Large-Scale Unstructured Point Data
In this paper, we present a novel method, the first to date to our knowledge, which is capable of directly and automatically producing a concise and idealized 3D representation f...
Anne-Laure Chauve, Patrick Labatut, Jean-Philippe ...
CONCUR
2012
Springer
13 years 8 months ago
Linearizability with Ownership Transfer
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it assumes a complete isolation between a library and ...
Alexey Gotsman, Hongseok Yang
ICIP
2007
IEEE
16 years 8 months ago
Edge Preserving Filters using Geodesic Distances on Weighted Orthogonal Domains
We introduce a framework for image enhancement, which smooths images while preserving edge information. Domain (spatial) and range (feature) information are combined in one single...
Luca Bertelli, B. S. Manjunath
ICDAR
2007
IEEE
16 years 20 days ago
Extraction of Vectorized Graphical Information from Scientific Chart Images
Graphical components information extraction is a crucial step in the chart recognition and understanding process. However, existing methods of information extraction from chart im...
Weihua Huang, Ruizhe Liu, Chew Lim Tan
JDA
2008
72views more  JDA 2008»
15 years 6 months ago
Semi-local longest common subsequences in subquadratic time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
Alexander Tiskin