2899 search results - page 169 / 580 » Dynamic Trees in Practice |
138
click to vote
TSMC
2010
14 years 11 months ago
2010
Computer system reliability is conventionally modeled and analyzed using techniques such as fault tree analysis (FTA) and reliability block diagrams (RBD), which provide static rep...
140
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
134
Voted
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
133
click to vote
CIG
2005
IEEE
15 years 10 months ago
2005
IEEE
Interactive computer games are widely seen as a killer application domain for Artificial Intelligence (AI) [8]. Quite apart from the significant size of the games market in terms...
121
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...