Sciweavers

7099 search results - page 1373 / 1420
» Context for models of concurrency
Sort
View
MEMOCODE
2006
IEEE
16 years 4 days ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
MSR
2006
ACM
16 years 2 days ago
Detecting similar Java classes using tree algorithms
Similarity analysis of source code is helpful during development to provide, for instance, better support for code reuse. Consider a development environment that analyzes code whi...
Tobias Sager, Abraham Bernstein, Martin Pinzger, C...
SI3D
2006
ACM
16 years 2 days ago
Splatting indirect illumination
Global illumination provides a visual richness not achievable with the direct illumination models used by most interactive applications. To generate global effects, numerous appro...
Carsten Dachsbacher, Marc Stamminger
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
16 years 2 days ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
SIGIR
2006
ACM
16 years 2 days ago
Mining dependency relations for query expansion in passage retrieval
Classical query expansion techniques such as the local context analysis (LCA) make use of term co-occurrence statistics to incorporate additional contextual terms for enhancing pa...
Renxu Sun, Chai-Huat Ong, Tat-Seng Chua
« Prev « First page 1373 / 1420 Last » Next »