Sciweavers

288 search results - page 24 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 10 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons
ICIAP
2007
ACM
16 years 6 months ago
Face Shape Reconstruction from Image Sequence Taken with Monocular Camera using Shape Database
We propose a method for reconstructing 3D face shape from a camera, which captures the object face from various viewing angles. In this method, we do not directly reconstruct the ...
Hideo Saito, Yosuke Ito, Masaaki Mochimaru
ICCAD
1998
IEEE
75views Hardware» more  ICCAD 1998»
15 years 10 months ago
A fast, accurate, and non-statistical method for fault coverage estimation
We present a fast, dynamic fault coverage estimation technique for sequential circuits that achieves high degrees of accuracy by signi cantly reducing the number of injected fault...
Michael S. Hsiao
CINQ
2004
Springer
131views Database» more  CINQ 2004»
15 years 11 months ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 6 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu