Sciweavers

2104 search results - page 257 / 421
» Sorting with networks of data structures
Sort
View
197
Voted
ISI
2006
Springer
15 years 5 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...
PROMISE
2010
14 years 12 months ago
Defect cost flow model: a Bayesian network for predicting defect correction effort
Background. Software defect prediction has been one of the central topics of software engineering. Predicted defect counts have been used mainly to assess software quality and est...
Thomas Schulz, Lukasz Radlinski, Thomas Gorges, Wo...
ICN
2007
Springer
15 years 11 months ago
Dynamic Tree Bitmap for IP Lookup and Update
We propose a data structure–dynamic tree bitmap–for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tr...
Sartaj Sahni, Haibin Lu
COOPIS
2004
IEEE
15 years 8 months ago
SPREE: Object Prefetching for Mobile Computers
Mobile platforms combined with large databases promise new opportunities for mobile applications. However, mobile computing devices may experience frequent communication loss while...
Kristian Kvilekval, Ambuj K. Singh
153
Voted
CGF
2008
110views more  CGF 2008»
15 years 5 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl