Sciweavers

391 search results - page 30 / 79
» Structural and algorithmic issues of dynamic protocol update
Sort
View
VLDB
2005
ACM
397views Database» more  VLDB 2005»
14 years 8 months ago
Concurrency control and recovery for balanced B-link trees
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 ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ICASSP
2011
IEEE
13 years 7 days ago
A dynamic approach to the selection of high order n-grams in phonotactic language recognition
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...
Mikel Peñagarikano, Amparo Varona, Luis Jav...
ICNP
2007
IEEE
14 years 2 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—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...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
COMCOM
2010
276views more  COMCOM 2010»
13 years 8 months ago
Adjustable convergecast tree protocol for wireless sensor networks
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...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
ICNP
2002
IEEE
14 years 1 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
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...
Murali S. Kodialam, T. V. Lakshman