336 search results - page 8 / 68 » Improved data structures for fully dynamic biconnectivity |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Classical dynamic Bayesian networks (DBNs) are based on the homogeneous Markov assumption and cannot deal with heterogeneity and non-stationarity in temporal processes. Various ap...
100
click to vote
CPM
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
103
click to vote
ISCA
2010
IEEE
15 years 4 months ago
2010
IEEE
Next generation tiled microarchitectures are going to be limited by off-chip misses and by on-chip network usage. Furthermore, these platforms will run an heterogeneous mix of ap...
114
click to vote
KDD
2007
ACM
16 years 3 days ago
2007
ACM
Commercial datasets are often large, relational, and dynamic. They contain many records of people, places, things, events and their interactions over time. Such datasets are rarel...
BPM
2006
Springer
15 years 3 months ago
2006
Springer
Composition languages like BPEL and many enactment tools only support structured process models, while most composition approaches only consider unstructured models. In this paper,...