Sciweavers

862 search results - page 130 / 173
» Random Information Spread in Networks
Sort
View
TIT
2008
103views more  TIT 2008»
14 years 11 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
CCS
2007
ACM
15 years 6 months ago
Memsherlock: an automated debugger for unknown memory corruption vulnerabilities
Software vulnerabilities have been the main contributing factor to the Internet security problems such as fast spreading worms. Among these software vulnerabilities, memory corrup...
Emre Can Sezer, Peng Ning, Chongkyung Kil, Jun Xu
SEMWEB
2007
Springer
15 years 6 months ago
X-SOM Results for OAEI 2007
This paper summarizes the results of the X-SOM tool in the OAEI 2007 campaign. X-SOM is an extensible ontology mapper that combines various matching algorithms by means of a feed-f...
Carlo Curino, Giorgio Orsi, Letizia Tanca
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
15 years 4 months ago
Fighting Censorship with Algorithms
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
Mohammad Mahdian
CIKM
2008
Springer
15 years 1 months ago
SNIF TOOL: sniffing for patterns in continuous streams
Continuous time-series sequence matching, specifically, matching a numeric live stream against a set of predefined pattern sequences, is critical for domains ranging from fire spr...
Abhishek Mukherji, Elke A. Rundensteiner, David C....