Sciweavers

524 search results - page 66 / 105
» Characterizing the Paralation Model using Dynamic Assignment
Sort
View
BROADNETS
2007
IEEE
14 years 2 months ago
Modeling and analysis of worm interactions (war of the worms)
—“War of the worms” is a war between opposing computer worms, creating complex worm interactions as well as detrimental impact on infrastructure. For example, in September 20...
Sapon Tanachaiwiwat, Ahmed Helmy
ICML
2009
IEEE
14 years 8 months ago
Learning dictionaries of stable autoregressive models for audio scene analysis
In this paper, we explore an application of basis pursuit to audio scene analysis. The goal of our work is to detect when certain sounds are present in a mixed audio signal. We fo...
Youngmin Cho, Lawrence K. Saul
ICANN
2010
Springer
13 years 7 months ago
On the Fringe of Awareness: The Glance-Look Model of Attention-Emotion Interactions
In previous work, we have developed a "Glance-Look" model, which has replicated a broad profile of data on the semantic Attentional Blink (AB) task and characterized how ...
Li Su, Philip Barnard, Howard Bowman
GCC
2005
Springer
14 years 1 months ago
Parallel Web Spiders for Cooperative Information Gathering
Web spider is a widely used approach to obtain information for search engines. As the size of the Web grows, it becomes a natural choice to parallelize the spider’s crawling proc...
Jiewen Luo, Zhongzhi Shi, Maoguang Wang, Wei Wang
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg