Sciweavers

2796 search results - page 413 / 560
» The coolest path problem
Sort
View
DIALM
2010
ACM
146views Algorithms» more  DIALM 2010»
15 years 7 months ago
Regional consecutive leader election in mobile ad-hoc networks
In this paper we introduce the regional consecutive leader election (RCLE) problem, which extends the classic leader election problem to the ever-changing environment of mobile ad-...
Hyun Chul Chung, Peter Robinson, Jennifer L. Welch
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 6 months ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
ENTCS
2010
99views more  ENTCS 2010»
15 years 6 months ago
State Based Robustness Testing for Components
Component based development allows to build software upon existing components and promises to improve software reuse and reduce costs. To gain reliability of a component based sys...
Bin Lei, Zhiming Liu, Charles Morisset, Xuandong L...
JNSM
2008
93views more  JNSM 2008»
15 years 6 months ago
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
Steven Noel, Sushil Jajodia
ECCV
2002
Springer
16 years 8 months ago
Building Roadmaps of Local Minima of Visual Models
Getting trapped in suboptimal local minima is a perennial problem in model based vision, especially in applications like monocular human body tracking where complex nonlinear para...
Cristian Sminchisescu, Bill Triggs