Sciweavers

6682 search results - page 1136 / 1337
» networks 2006
Sort
View
CORR
2006
Springer
153views Education» more  CORR 2006»
15 years 7 months ago
A distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
Christian Lavault, Mario Valencia-Pabon
DPD
2006
114views more  DPD 2006»
15 years 7 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
ENTCS
2006
124views more  ENTCS 2006»
15 years 7 months ago
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
Public key cryptography has been invented to overcome some key management problems in open networks. Although nearly all aspects of public key cryptography rely on the existence of...
Katja Schmidt-Samoa
ENTCS
2006
161views more  ENTCS 2006»
15 years 7 months ago
Architecture Normalization for Component-based Systems
Being able to systematically change the original architecture of a component-based system to a desired target architecture without changing the set of functional requirements of t...
Lian Wen, R. Geoff Dromey
EOR
2006
57views more  EOR 2006»
15 years 7 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro
« Prev « First page 1136 / 1337 Last » Next »