Sciweavers

2006 search results - page 348 / 402
» Heuristic Security-Testing Methods
Sort
View
JCNS
2010
86views more  JCNS 2010»
13 years 7 months ago
Reduced models for binocular rivalry
Binocular rivalry occurs when two very different images are presented to the two eyes, but a subject perceives only one image at a given time. A number of computational models for...
Carlo R. Laing, Thomas Frewen, Ioannis G. Kevrekid...
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 7 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
PKDD
2010
Springer
150views Data Mining» more  PKDD 2010»
13 years 7 months ago
Virus Propagation on Time-Varying Networks: Theory and Immunization Algorithms
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
B. Aditya Prakash, Hanghang Tong, Nicholas Valler,...
CORR
2010
Springer
427views Education» more  CORR 2010»
13 years 7 months ago
A Comparison between Memetic algorithm and Genetic algorithm for the cryptanalysis of Simplified Data Encryption Standard algori
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...
Poonam Garg
ICIP
2010
IEEE
13 years 7 months ago
Reducing graphs in graph cut segmentation
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
Nicolas Lerme, François Malgouyres, Lucas L...