Sciweavers

4744 search results - page 519 / 949
» Connected Computing
Sort
View
PDPTA
2004
15 years 8 months ago
On the Use of NSGrid for Accurate Grid Schedule Evaluation
Abstract Computational Grids consist of a multitude of geographically distributed resources. The co-allocation of several of those resources allows for the execution of highly comp...
Bruno Volckaert, Pieter Thysebaert, Marc De Leenhe...
TCOM
2008
92views more  TCOM 2008»
15 years 7 months ago
Mailbox switch: a scalable two-stage switch architecture for conflict resolution of ordered packets
Abstract-- Traditionally, conflict resolution in an inputbuffered switch is solved by finding a matching between inputs and outputs per time slot. To do this, a switch not only nee...
Cheng-Shang Chang, Duan-Shin Lee, Ying-Ju Shih, Ch...
CAD
2005
Springer
15 years 7 months ago
Optimizing the topological and combinatorial complexity of isosurfaces
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
Carlos Andújar, Pere Brunet, Antoni Chica, ...
JHSN
2000
390views more  JHSN 2000»
15 years 6 months ago
Telemedicine: challenges and opportunities
Telemedicine is many things to many people. Only until a few years ago, telemedicine was equated to video teleconferencing between physicians, while nowadays, perhaps the most acti...
Sang-goo Lee, Seong K. Mun, Prakash Jha, Betty Ann...
IWPEC
2010
Springer
15 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...