Sciweavers

5658 search results - page 38 / 1132
» An Efficient Counting Network
Sort
View
ICASSP
2009
IEEE
14 years 4 months ago
An efficient and robust method for detecting copy-move forgery
Copy-move forgery is a specific type of image tampering, where a part of the image is copied and pasted on another part of the same image. In this paper, we propose a new approac...
Sevinc Bayram, Husrev T. Sencar, Nasir D. Memon
ASPLOS
1992
ACM
14 years 2 months ago
Efficient Superscalar Performance Through Boosting
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
Michael D. Smith, Mark Horowitz, Monica S. Lam
AMT
2006
Springer
108views Multimedia» more  AMT 2006»
13 years 12 months ago
Efficient Frequent Itemsets Mining by Sampling
As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get appro...
Yanchang Zhao, Chengqi Zhang, Shichao Zhang
FAW
2008
Springer
111views Algorithms» more  FAW 2008»
13 years 11 months ago
Efficient First-Order Model-Checking Using Short Labels
We prove that there exists an O(log(n))-labeling scheme for every first-order formula with free set variables in every class of graphs that is nicely locally cwd-decomposable, whic...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...
MOC
1998
88views more  MOC 1998»
13 years 9 months ago
A space efficient algorithm for group structure computation
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
Edlyn Teske