Sciweavers

2463 search results - page 111 / 493
» Compressing Pattern Databases
Sort
View
MASCOTS
2010
14 years 7 days ago
Efficient Discovery of Loop Nests in Execution Traces
Execution and communication traces are central to performance modeling and analysis. Since the traces can be very long, meaningful compression and extraction of representative beha...
Qiang Xu, Jaspal Subhlok, Nathaniel Hammen
IS
2008
13 years 10 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
KES
2005
Springer
14 years 4 months ago
Feature Generation by Simple FLD
This paper presents a new algorithm for feature generation, which is approximately derived based on geometrical interpretation of the Fisher linear discriminant analysis. In a fiel...
Minoru Fukumi, Yasue Mitsukura
ICDE
1993
IEEE
147views Database» more  ICDE 1993»
14 years 2 months ago
Large Object Support in POSTGRES
This paper presents four implementations for support of large objects in POSTGRES. The four implementations offer varying levels of support for security, transactions, compression...
Michael Stonebraker, Michael A. Olson
SIGPRO
2011
249views Hardware» more  SIGPRO 2011»
13 years 1 months ago
Extracting biometric binary strings with minimal area under the FRR curve for the hamming distance classifier
Quantizing real-valued templates into binary strings is a fundamental step in biometric compression and template protection. In this paper, we introduce the area under the FRR cur...
C. Chen, R. Veldhuis