Sciweavers

501 search results - page 55 / 101
» An Upper Bound on the Number of Rectangulations of a Point S...
Sort
View
MP
2010
99views more  MP 2010»
13 years 6 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
HICSS
2006
IEEE
165views Biometrics» more  HICSS 2006»
14 years 1 months ago
Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast
Secure multicast has a variety of applications in ecommerce, e-banking, command and control, video-ondemand, and other internet-based services. In this paper, we present algorithm...
Mohammad Hossain Heydari, Linda Morales, Ivan Hal ...
ISMB
1993
13 years 9 months ago
Discovering Sequence Similarity by the Algorithmic Significance Method
The minimal-length encoding approach is applied to define concept of sequence similarity. Asequence is defined to be similar to another sequence or to a set of keywords if it can ...
Aleksandar Milosavljevic
TIT
2010
173views Education» more  TIT 2010»
13 years 2 months ago
Asymptotic critical transmission radius for k-connectivity in wireless ad hoc networks
A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's...
Peng-Jun Wan, Chih-Wei Yi, Lixin Wang
DIALM
2005
ACM
104views Algorithms» more  DIALM 2005»
13 years 9 months ago
Information dissemination in highly dynamic graphs
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
Regina O'Dell, Roger Wattenhofer