Sciweavers

3172 search results - page 387 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
VISUALIZATION
2005
IEEE
16 years 8 days ago
Streaming Meshes
Recent years have seen an immense increase in the complexity of geometric data sets. Today’s gigabyte-sized polygon models can no longer be completely loaded into the main memor...
Martin Isenburg, Peter Lindstrom
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
16 years 7 days ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
CRYPTO
2005
Springer
164views Cryptology» more  CRYPTO 2005»
16 years 7 days ago
Composition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure agains...
Krzysztof Pietrzak
DIGRA
2005
Springer
16 years 7 days ago
Fictive affinities in Final Fantasy XI: complicit and critical play in fantastic nations.
Like many massively-multiplayer role-playing games, Final Fantasy XI is a persistent world with a heroic fantasy setting. This paper discusses fictive player identities, and descr...
William Huber
OOPSLA
2005
Springer
16 years 5 days ago
GOOAL: an educational object oriented analysis laboratory
Our goal is to enable rapid production of static and dynamic object models from natural language description of problems. Rapid modeling is achieved through automation of analysis...
Hector G. Pérez-González, Jugal K. K...