Sciweavers

4744 search results - page 908 / 949
» Connected Computing
Sort
View
APPROX
2007
Springer
100views Algorithms» more  APPROX 2007»
14 years 2 months ago
Implementing Huge Sparse Random Graphs
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
Moni Naor, Asaf Nussboim
CSL
2007
Springer
14 years 2 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
ICCS
2007
Springer
14 years 2 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
ICN
2007
Springer
14 years 2 months ago
Active Peer to Peer
—Peer to peer is an important way for files sharing. In existing P2P systems, users need to query and retrieve files, and have to know some knowledge, such as file names, keyword...
Xuelian Lin, Jinpeng Huai, Xudong Liu, Jun Han
IPOM
2007
Springer
14 years 2 months ago
Measurement and Analysis of Intraflow Performance Characteristics of Wireless Traffic
It is by now widely accepted that the arrival process of aggregate network traffic exhibits self-similar characteristics which result in the preservation of traffic burstiness (hig...
Dimitrios P. Pezaros, Manolis Sifalakis, David Hut...