Sciweavers

4744 search results - page 26 / 949
» Connected Computing
Sort
View
CCGRID
2002
IEEE
14 years 1 months ago
Maintaining Connectivity in a Scalable and Robust Distributed Environment
This paper describes a novel peer-to-peer (P2P) environment for running distributed Java applications on the Internet. The possible application areas include simple load balancing...
Márk Jelasity, Mike Preuß, Maarten va...
INTERACT
2007
13 years 10 months ago
The Challenges of Creating Connections and Raising Awareness: Experience from UCLIC
With current disciplinary structures and academic priorities, Human– Computer Interaction faces ongoing challenges: is it a discipline in its own right, or simply a sub-disciplin...
Ann Blandford, Rachel Benedyk, Nadia Berthouze, An...
IPPS
2000
IEEE
14 years 25 days ago
On Identifying Strongly Connected Components in Parallel
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar
CGF
2010
99views more  CGF 2010»
13 years 8 months ago
Trivial Connections on Discrete Surfaces
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
Keenan Crane, Mathieu Desbrun, Peter Schröder
SC
1994
ACM
14 years 16 days ago
PARAMICS - moving vehicles on the connection machine
PARAMICS is a PARAllel MICroscopic Traffic Simulator which is, to our knowledge, the most powerful of its type in the world. The simulator can model around 200,000 vehicles on aro...
Gordon Cameron, Brian J. N. Wylie, David McArthur