Sciweavers

6300 search results - page 239 / 1260
» We have it easy, but do we have it right
Sort
View
CORR
2010
Springer
175views Education» more  CORR 2010»
15 years 1 months ago
Detecting Security threats in the Router using Computational Intelligence
Information security is an issue of global concern. As the Internet is delivering great convenience and benefits to the modern society, the rapidly increasing connectivity and acc...
J. Visumathi, K. L. Shunmuganathan
DAC
1999
ACM
16 years 2 months ago
Effective Iterative Techniques for Fingerprinting Design IP
While previous watermarking-based approaches to intellectual property protection (IPP) have asymmetrically emphasized the IP provider's rights, the true goal of IPP is to ens...
Andrew E. Caldwell, Hyun-Jin Choi, Andrew B. Kahng...
TPDS
1998
114views more  TPDS 1998»
15 years 1 months ago
On the Automatic Parallelization of the Perfect Benchmarks
We present a set of advanced program parallelization techniques that are able to signi cantly improve the performance of application programs. We present evidence for this improve...
Rudolf Eigenmann, Jay Hoeflinger, David A. Padua
ICCV
2001
IEEE
16 years 3 months ago
Computing Visual Correspondence with Occlusions via Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
Vladimir Kolmogorov, Ramin Zabih
CIE
2009
Springer
15 years 8 months ago
Numberings and Randomness
Abstract. We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L¨of random left-compu...
Paul Brodhead, Bjørn Kjos-Hanssen