Sciweavers

5889 search results - page 1155 / 1178
» Graph Layout Problems
Sort
View
95
Voted
CRYPTO
2007
Springer
134views Cryptology» more  CRYPTO 2007»
15 years 3 months ago
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}ā...
Ueli M. Maurer, Stefano Tessaro
GEOS
2007
Springer
15 years 3 months ago
Modeling Spatio-temporal Network Computations: A Summary of Results
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of...
Betsy George, Shashi Shekhar
ICCS
2007
Springer
15 years 3 months ago
Characterizing Implications of Injective Partial Orders
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
José L. Balcázar, Gemma C. Garriga
103
Voted
DSN
2006
IEEE
15 years 3 months ago
Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
Antonio Fernández, Ernesto Jiménez, ...
INFOCOM
2006
IEEE
15 years 3 months ago
Capacity-Constrained Design of Resilient Multi-Tier Wireless Mesh Networks
nts etc.), an abstract graph of the deployment area and QoS constraints to generate appropriate logical topologies. WIND starts with the set of network elements to be deployed (Nod...
R. Raghuraman, Sridhar Iyer
« Prev « First page 1155 / 1178 Last » Next »