Sciweavers

1399 search results - page 208 / 280
» Multi-party Finite Computations
Sort
View
PE
2008
Springer
109views Optimization» more  PE 2008»
15 years 4 months ago
A conditional probability approach to M/G/1-like queues
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...
Alexandre Brandwajn, Hongyun Wang
SOCA
2008
IEEE
15 years 4 months ago
Specification of realizable service conversations using collaboration diagrams
Specification, modeling and analysis of interactions among peers that communicate via messages are becoming increasingly important due to the emergence of service oriented computi...
Tevfik Bultan, Xiang Fu
CAD
2005
Springer
15 years 4 months ago
Creation of a unit block library of architectures for use in assembled scaffold engineering
Guided tissue regeneration is gaining importance in the field of orthopaedic tissue engineering as need and technology permits the development of site-specific engineering approac...
M. A. Wettergreen, B. S. Bucklen, Binil Starly, E....
TSP
2008
113views more  TSP 2008»
15 years 4 months ago
Avoiding Divergence in the Shalvi-Weinstein Algorithm
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
Maria D. Miranda, Magno T. M. Silva, Victor H. Nas...
CORR
2010
Springer
81views Education» more  CORR 2010»
14 years 11 months ago
Analysis of Agglomerative Clustering
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
Marcel R. Ackermann, Johannes Blömer, Daniel ...