Sciweavers

311 search results - page 57 / 63
» Approximate XML joins
Sort
View
NETWORKING
2000
15 years 1 months ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto
CAD
2006
Springer
14 years 11 months ago
A rational extension of Piegl's method for filling n-sided holes
N-sided hole filling plays an important role in vertex blending. To deal with the case that the corner is surrounded by rational surfaces (i.e. NURBS surfaces), an algorithm to fi...
Yi-Jun Yang, Jun-Hai Yong, Hui Zhang, Jean-Claude ...
QUESTA
2006
101views more  QUESTA 2006»
14 years 11 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
GLOBECOM
2010
IEEE
14 years 9 months ago
Analysis of Messaging Load in a P2PP Overlay Network under Churn
We analyze the performance of a DHT-based P2P overlay network in resource access and overlay maintenance activities. We use a cross-platform implementation of the protocol called P...
Otso Kassinen, Erkki Harjula, Mika Ylianttila
NCA
2010
IEEE
14 years 6 months ago
Composable continuous-space programs for robotic swarms
Programmability is an increasingly important barrier to the deployment of multi-robot systems, as no prior approach allows routine composition and reuse of general aggregate behavi...
Jonathan Bachrach, Jacob Beal, James McLurkin