Sciweavers

662 search results - page 72 / 133
» A comparative benchmark of large objects in relational datab...
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 9 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 11 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
EDBTW
2006
Springer
13 years 9 months ago
The Importance of Algebra for XML Query Processing
Abstract. Relational algebra has been a crucial foundation for relational database systems, and has played a large role in enabling their success. A corresponding XML algebra for X...
Stelios Paparizos, H. V. Jagadish
PAMI
2008
221views more  PAMI 2008»
13 years 7 months ago
Plane-Based Optimization for 3D Object Reconstruction from Single Line Drawings
In previous optimization-based methods of 3D planar-faced object reconstruction from single 2D line drawings, the missing depths of the vertices of a line drawing (and other parame...
Jianzhuang Liu, Liangliang Cao, Zhenguo Li, Xiaoou...
IWDW
2009
Springer
14 years 2 months ago
Estimating the Information Theoretic Optimal Stego Noise
We recently developed a new benchmark for steganography, underpinned by the square root law of capacity, called Steganographic Fisher Information (SFI). It is related to the multip...
Andrew D. Ker