Sciweavers

35 search results - page 2 / 7
» Dynamic symbolic data structure repair
Sort
View
ICPR
2010
IEEE
13 years 9 months ago
Symbol Classification Using Dynamic Aligned Shape Descriptor
Shape representation is a difficult task because of several symbol distortions, such as occlusions, elastic deformations, gaps or noise. In this paper, we propose a new descriptor ...
Alicia Fornés, Sergio Escalera, Josep Llados, Ern...
SIGCOMM
2010
ACM
13 years 5 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
13 years 2 months ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...
SC
1991
ACM
13 years 8 months ago
A method of vector processing for shared symbolic data
Kanada, Y., A method of vector processing for shared symbolic data, Parallel Computing, X (1993) XXX-XXX. Conventional processing techniques for pipelined vector processors such a...
Yasusi Kanada
TALG
2008
131views more  TALG 2008»
13 years 4 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir