Sciweavers

3466 search results - page 403 / 694
» Fast computation of special resultants
Sort
View
ARCS
2005
Springer
16 years 10 days ago
Towards Autonomic Networking Using Overlay Routing Techniques
With an ever-growing number of computers being embedded into our surroundings, the era of ubiquitous computing is approaching fast. However, as the number of networked devices incr...
Kendy Kutzner, Curt Cramer, Thomas Fuhrmann
ICALP
2004
Springer
16 years 5 days ago
A Faster Algorithm for Minimum Cycle Basis of Graphs
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
GRID
2003
Springer
16 years 17 hour ago
Evaluating Scheduling and Replica Optimisation Strategies in OptorSim
Grid computing is fast emerging as the solution to the problems posed by the massive computational and data handling requirements of many current international scientific project...
David G. Cameron, Rubén Carvajal-Schiaffino...
CLUSTER
2002
IEEE
15 years 11 months ago
Shell over a Cluster (SHOC): Towards Achieving Single System Image via the Shell
With dramatic improvements in cost-performance, the use of clusters of personal computers is fast becoming widespread. For ease of use and management, a Single System Image (SSI) ...
C. M. Tan, C. P. Tan, Weng-Fai Wong
SIGGRAPH
2010
ACM
15 years 11 months ago
Discrete viscous threads
We present a continuum-based discrete model for thin threads of viscous fluid by drawing upon the Rayleigh analogy to elastic rods, demonstrating canonical coiling, folding, and ...
Miklós Bergou, Basile Audoly, Etienne Vouga, Max ...