Sciweavers

49 search results - page 6 / 10
» Exploiting Domain structure to Achieve Efficient Temporal Re...
Sort
View
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 7 months ago
Efficient Query Evaluation over Compressed XML Data
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried i...
Andrei Arion, Angela Bonifati, Gianni Costa, Sandr...
AIPS
2006
13 years 8 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
CGF
2008
227views more  CGF 2008»
13 years 7 months ago
Dynamic Sampling and Rendering of Algebraic Point Set Surfaces
Algebraic Point Set Surfaces (APSS) define a smooth surface from a set of points using local moving least-squares (MLS) fitting of algebraic spheres. In this paper we first revisi...
Gaël Guennebaud, Marcel Germann, Markus H. Gr...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
Ontology-based Queries over Cancer Data
The ever-increasing amount of data in biomedical research, and in cancer research in particular, needs to be managed to support efficient data access, exchange and integration. Exi...
Alejandra González Beltrán, Ben Tagg...
ICDE
2008
IEEE
147views Database» more  ICDE 2008»
14 years 8 months ago
Fast Indexes and Algorithms for Set Similarity Selection Queries
Data collections often have inconsistencies that arise due to a variety of reasons, and it is desirable to be able to identify and resolve them efficiently. Set similarity queries ...
Marios Hadjieleftheriou, Amit Chandel, Nick Koudas...