Sciweavers

683 search results - page 16 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
DKE
2002
107views more  DKE 2002»
13 years 7 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
14 years 1 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
SIGMOD
2006
ACM
174views Database» more  SIGMOD 2006»
14 years 8 months ago
Dynamic authenticated index structures for outsourced databases
In outsourced database (ODB) systems the database owner publishes its data through a number of remote servers, with the goal of enabling clients at the edge of the network to acce...
Feifei Li, Marios Hadjieleftheriou, George Kollios...
ICDM
2010
IEEE
108views Data Mining» more  ICDM 2010»
13 years 5 months ago
Assessing Data Mining Results on Matrices with Randomization
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
Markus Ojala
ICML
2004
IEEE
14 years 8 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu