Sciweavers

166 search results - page 15 / 34
» Efficient worst case timing analysis of data caching
Sort
View
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 5 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICML
2000
IEEE
14 years 8 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
ISW
2010
Springer
13 years 5 months ago
An Analysis of DepenDNS
Recently, a new scheme to protect clients against DNS cache poisoning attacks was introduced. The scheme is referred to as DepenDNS and is intended to protect clients against such ...
Nadhem J. AlFardan, Kenneth G. Paterson
INFOCOM
2000
IEEE
14 years 15 hour ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Improving evolutionary real-time testing
Embedded systems are often used in a safety-critical context, e.g. in airborne or vehicle systems. Typically, timing constraints must be satisfied so that real-time embedded syste...
Marouane Tlili, Stefan Wappler, Harmen Sthamer