Sciweavers

11212 search results - page 616 / 2243
» Semi-persistent Data Structures
Sort
View
ACMMSP
2006
ACM
226views Hardware» more  ACMMSP 2006»
15 years 11 months ago
Smarter garbage collection with simplifiers
We introduce a method for providing lightweight daemons, called simplifiers, that attach themselves to program data. If a data item has a simplifier, the simplifier may be run aut...
Melissa E. O'Neill, F. Warren Burton
BPSC
2007
171views Business» more  BPSC 2007»
15 years 8 months ago
XML Databases: Principles and Usage
Originally XML was used as a standard protocol for data exchange in computing. The evolution of information technology has opened up new situations in which XML can be used to aut...
Jaroslav Pokorný
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 7 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 7 months ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
SIBGRAPI
2006
IEEE
16 years 1 months ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...