Sciweavers

386 search results - page 53 / 78
» Extracting Support Data for a Given Task
Sort
View
EDBT
2009
ACM
136views Database» more  EDBT 2009»
14 years 2 months ago
Finding frequent co-occurring terms in relational keyword search
Given a set Q of keywords, conventional keyword search (KS) returns a set of tuples, each of which (i) is obtained from a single relation, or by joining multiple relations, and (i...
Yufei Tao, Jeffrey Xu Yu
ICIP
2004
IEEE
14 years 9 months ago
A blind cdma image watermarking scheme in wavelet domain
The paper proposes a blind spread spectrum watermarking scheme where watermark information is embedded redundantly in the multilevel wavelet coefficients of the cover image. It ha...
Santi P. Maity, Malay Kumar Kundu
ECCV
2010
Springer
14 years 10 days ago
Efficiently Scaling Up Video Annotation with Crowdsourced Marketplaces
Accurately annotating entities in video is labor intensive and expensive. As the quantity of online video grows, traditional solutions to this task are unable to scale to meet the ...
ISCI
2011
13 years 2 months ago
A tool for design pattern detection and software architecture reconstruction
It is well known that software maintenance and evolution are expensive activities, both in terms of invested time and money. Reverse engineering activities support the obtainment ...
Francesca Arcelli Fontana, Marco Zanoni
CIKM
2006
Springer
13 years 11 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum