Sciweavers

10890 search results - page 2107 / 2178
» Automatic Complexity Analysis
Sort
View
SPAA
2003
ACM
14 years 29 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler
IBPRIA
2003
Springer
14 years 28 days ago
A Colour Tracking Procedure for Low-Cost Face Desktop Applications
In this paper we present an environment for the tracking of a human face obtained from a real video sequence. We will describe the system and discuss the advantages and disadvanta...
Francisco J. Perales López, Ramon Mas, Miqu...
IDEAL
2003
Springer
14 years 27 days ago
Detecting Distributed Denial of Service (DDoS) Attacks through Inductive Learning
As the complexity of Internet is scaled up, it is likely for the Internet resources to be exposed to Distributed Denial of Service (DDoS) flooding attacks on TCP-based Web servers....
Sanguk Noh, Cheolho Lee, Kyunghee Choi, Gihyun Jun...
COMPGEOM
2010
ACM
14 years 24 days ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
PLDI
2010
ACM
14 years 24 days ago
Adversarial memory for detecting destructive races
Multithreaded programs are notoriously prone to race conditions, a problem exacerbated by the widespread adoption of multi-core processors with complex memory models and cache coh...
Cormac Flanagan, Stephen N. Freund
« Prev « First page 2107 / 2178 Last » Next »