Sciweavers

3008 search results - page 526 / 602
» Independence in connected graphs
Sort
View
ICDCS
2010
IEEE
15 years 10 months ago
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Abstract—Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts the system’s performance. Determining a ...
Chen Chen, Hans-Arno Jacobsen, Roman Vitenberg
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
15 years 10 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
AFRIGRAPH
2001
ACM
15 years 10 months ago
A gesture processing framework for multimodal interaction in virtual reality
This article presents a gesture detection and analysis framework for modelling multimodal interactions. It is particulary designed for its use in Virtual Reality (VR) applications...
Marc Erich Latoschik
PKC
2000
Springer
120views Cryptology» more  PKC 2000»
15 years 10 months ago
Optimally Efficient Accountable Time-Stamping
Abstract. Efficient secure time-stamping schemes employ a 2-level approach in which the time-stamping service operates in rounds. We say that a time-stamping service is accountable...
Ahto Buldas, Helger Lipmaa, Berry Schoenmakers