Sciweavers

1675 search results - page 163 / 335
» Implementing Data Cubes Efficiently
Sort
View
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 7 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
127
Voted
CGF
2008
227views more  CGF 2008»
15 years 2 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...
ENTCS
2008
105views more  ENTCS 2008»
15 years 2 months ago
Declaring Numbers
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
Bernd Braßel, Sebastian Fischer, Frank Huch
117
Voted
ECML
2007
Springer
15 years 8 months ago
Discovering Word Meanings Based on Frequent Termsets
Word meaning ambiguity has always been an important problem in information retrieval and extraction, as well as, text mining (documents clustering and classification). Knowledge di...
Henryk Rybinski, Marzena Kryszkiewicz, Grzegorz Pr...
CCECE
2006
IEEE
15 years 8 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...