Sciweavers

10909 search results - page 599 / 2182
» Evaluating Backup Algorithms
Sort
View
ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 9 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
CVPR
2008
IEEE
16 years 9 months ago
A unified framework for generalized Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
Shuiwang Ji, Jieping Ye
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 8 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 7 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
16 years 7 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou