Sciweavers

625 search results - page 47 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
RAID
2009
Springer
15 years 6 months ago
Multi-byte Regular Expression Matching with Speculation
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs...
Daniel Luchaup, Randy Smith, Cristian Estan, Somes...
PERSUASIVE
2007
Springer
15 years 6 months ago
Toward a Systematic Understanding of Suggestion Tactics in Persuasive Technologies
The unique capabilities of mobile, context-aware, networked devices make them an interesting platform for applying suggestion in persuasive technologies. Because these devices are ...
Adrienne H. Andrew, Gaetano Borriello, James Fogar...
PKDD
2010
Springer
150views Data Mining» more  PKDD 2010»
14 years 10 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,...
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 6 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
INFOCOM
2005
IEEE
15 years 5 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub