Sciweavers

1787 search results - page 62 / 358
» Approximation Techniques for Spatial Data
Sort
View
SIGSOFT
2008
ACM
14 years 9 months ago
A scalable technique for characterizing the usage of temporaries in framework-intensive Java applications
Framework-intensive applications (e.g., Web applications) heavily use temporary data structures, often resulting in performance bottlenecks. This paper presents an optimized blend...
Bruno Dufour, Barbara G. Ryder, Gary Sevitsky
ICDAR
2011
IEEE
12 years 8 months ago
Symbol Spotting in Line Drawings through Graph Paths Hashing
—In this paper we propose a symbol spotting technique through hashing the shape descriptors of graph paths (Hamiltonian paths). Complex graphical structures in line drawings can ...
Anjan Dutta, Josep Lladós, Umapada Pal
SDM
2003
SIAM
129views Data Mining» more  SDM 2003»
13 years 10 months ago
Approximate Query Answering by Model Averaging
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
Dmitry Pavlov, Padhraic Smyth
ESWA
2006
161views more  ESWA 2006»
13 years 8 months ago
Automated trend analysis of proteomics data using an intelligent data mining architecture
Proteomics is a field dedicated to the analysis and identification of proteins within an organism. Within proteomics, two-dimensional electrophoresis (2-DE) is currently unrivalle...
James Malone, Kenneth McGarry, Chris Bowerman
GBRPR
2005
Springer
14 years 2 months ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli