Sciweavers

2635 search results - page 274 / 527
» Algorithms for the Database Layout Problem
Sort
View
IJCAI
1997
15 years 8 months ago
Efficiently Executing Information-Gathering Plans
Themost costly aspect of gathering information over the Internet is that of transferring data over the networkto answer the user’s query. Wemaketwo contributions in this paperth...
Marc Friedman, Daniel S. Weld
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 8 months ago
Optimal Prediction for Prefetching in the Worst Case
Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...
P. Krishnan, Jeffrey Scott Vitter
FGR
2006
IEEE
297views Biometrics» more  FGR 2006»
16 years 20 days ago
Automatic Skin Segmentation for Gesture Recognition Combining Region and Support Vector Machine Active Learning
Skin segmentation is the cornerstone of many applications such as gesture recognition, face detection, and objectionable image filtering. In this paper, we attempt to address the ...
Junwei Han, George Awad, Alistair Sutherland, Hai ...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 6 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
IEEEHPCS
2010
15 years 5 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...