Sciweavers

1191 search results - page 177 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
PAKDD
2009
ACM
170views Data Mining» more  PAKDD 2009»
15 years 7 months ago
Discovering Periodic-Frequent Patterns in Transactional Databases.
Since mining frequent patterns from transactional databases involves an exponential mining space and generates a huge number of patterns, efficient discovery of user-interest-based...
Byeong-Soo Jeong, Chowdhury Farhan Ahmed, Syed Kha...
ICCAD
2008
IEEE
98views Hardware» more  ICCAD 2008»
15 years 6 months ago
Statistical path selection for at-speed test
Abstract— Process variations make at-speed testing significantly more difficult. They cause subtle delay changes that are distributed rather than the localized nature of a trad...
Vladimir Zolotov, Jinjun Xiong, Hanif Fatemi, Chan...
CVPR
2009
IEEE
15 years 4 months ago
Saliency-based discriminant tracking
We propose a biologically inspired framework for visual tracking based on discriminant center surround saliency. At each frame, discrimination of the target from the background is...
Vijay Mahadevan, Nuno Vasconcelos
CVPR
2009
IEEE
15 years 4 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu