Sciweavers

765 search results - page 104 / 153
» Empirical Design of Geometric Algorithms
Sort
View
KAIS
2006
164views more  KAIS 2006»
14 years 11 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
ML
2010
ACM
210views Machine Learning» more  ML 2010»
14 years 10 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
TIP
2010
142views more  TIP 2010»
14 years 6 months ago
A Blind Watermarking Scheme Using New Nontensor Product Wavelet Filter Banks
As an effective method for copyright protection of digital products against illegal usage, watermarking in wavelet domain has recently received considerable attention due to the de...
Xinge You, Liang Du, Yiu-ming Cheung, Qiuhui Chen
ICDE
2011
IEEE
238views Database» more  ICDE 2011»
14 years 3 months ago
Join queries on uncertain data: Semantics and efficient processing
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
Tingjian Ge
COCOON
2011
Springer
13 years 11 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...