Sciweavers

1080 search results - page 160 / 216
» The Complexity of Belief Update
Sort
View
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
CTRSA
2009
Springer
127views Cryptology» more  CTRSA 2009»
16 years 1 months ago
Adaptive-ID Secure Revocable Identity-Based Encryption
Abstract. Identity-Based Encryption (IBE) offers an interesting alternative to PKI-enabled encryption as it eliminates the need for digital certificates. While revocation has bee...
Benoît Libert, Damien Vergnaud
ICFCA
2009
Springer
16 years 1 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
CCGRID
2009
IEEE
16 years 1 months ago
Multicast Trees for Collaborative Applications
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
Krzysztof Rzadca, Jackson Tan Teck Yong, Anwitaman...
GLOBECOM
2009
IEEE
16 years 1 months ago
Interference Subspace Tracking for Network Interference Alignment in Cellular Systems
— In this paper, a practical solution to implement the distributed interference alignment (IA) algorithm of [1] in a cellular communication system is proposed. In the training pe...
Bo Niu, Alexander M. Haimovich