391 search results - page 30 / 79 » Structural and algorithmic issues of dynamic protocol update |
192
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
76
Voted
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
Due to computational bounds, most SVM-based phonotactic language recognition systems consider only low-order n-grams (up to n = 3), thus limiting the potential performance of this...
ICNP
2007
IEEE
15 years 5 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
111
click to vote
COMCOM
2010
14 years 11 months ago
2010
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
114
click to vote
ICNP
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...