Sciweavers

1439 search results - page 170 / 288
» Fast approximation of centrality
Sort
View
96
Voted
DEXAW
2005
IEEE
151views Database» more  DEXAW 2005»
15 years 6 months ago
An Overlay Network for Resource Discovery in Grids
As Grids try to achieve optimal and balanced utilization of unused resources in a distributed system, fast and efficient discovery of resource states is a key requirement. For sm...
Manfred Hauswirth, Roman Schmidt
HOTI
2005
IEEE
15 years 6 months ago
A Scalable Switch for Service Guarantees
— Operators need routers to provide service guarantees such as guaranteed flow rates and fairness among flows, so as to support real-time traffic and traffic engineering. How...
Bill Lin, Isaac Keslassy
104
Voted
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
15 years 6 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
EUROPAR
2005
Springer
15 years 6 months ago
A Grid Information Service Based on Peer-to-Peer
Abstract. Information Services are fundamental blocks of the Grid infrastructure. They are responsible for collecting and distributing information about resource availability and s...
Diego Puppin, Stefano Moncelli, Ranieri Baraglia, ...
87
Voted
RT
2005
Springer
15 years 6 months ago
Radiance Cache Splatting: A GPU-Friendly Global Illumination Algorithm
Fast global illumination computation is a challenge in several fields such as lighting simulation and computergenerated visual effects for movies. To this end, the irradiance cac...
Pascal Gautron, Jaroslav Krivánek, Kadi Bou...