Sciweavers

849 search results - page 142 / 170
» Completely Non-malleable Schemes
Sort
View
JANCL
2007
115views more  JANCL 2007»
13 years 9 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
TOG
2008
145views more  TOG 2008»
13 years 9 months ago
Real-time KD-tree construction on graphics hardware
We present an algorithm for constructing kd-trees on GPUs. This algorithm achieves real-time performance by exploiting the GPU's streaming architecture at all stages of kd-tr...
Kun Zhou, Qiming Hou, Rui Wang 0004, Baining Guo
TON
2008
96views more  TON 2008»
13 years 9 months ago
MICRON: a framework for connection establishment in optical networks
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology s...
Srinivasan Ramasubramanian, Arun K. Somani
JVCIR
2007
157views more  JVCIR 2007»
13 years 8 months ago
Position based dynamics
The most popular approaches for the simulation of dynamic systems in computer graphics are force based. Internal and external forces are accumulated from which accelerations are c...
Matthias Müller, Bruno Heidelberger, Marcus H...
TWC
2008
112views more  TWC 2008»
13 years 8 months ago
Design and Analysis of Cross-Layer Tree Algorithms for Wireless Random Access
In this paper, we develop a random access scheme which combines the widely used binary exponential backoff (BEB) algorithm with a cross-layer tree algorithm (TA) that relies on suc...
Xin Wang, Yingqun Yu, Georgios B. Giannakis