Sciweavers

2060 search results - page 224 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 6 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira
GRAPHITE
2003
ACM
15 years 11 months ago
Scalable photon splatting for global illumination
In this paper, we present a new image based method for computing efficiently global illumination using graphics hardware. We propose a two pass method to compute global lighting ...
Fabien Lavignotte, Mathias Paulin
FCT
2003
Springer
15 years 11 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 6 days ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CODES
2011
IEEE
14 years 5 months ago
DistRM: distributed resource management for on-chip many-core systems
The trend towards many-core systems comes with various issues, among them their highly dynamic and non-predictable workloads. Hence, new paradigms for managing resources of many-c...
Sebastian Kobbe, Lars Bauer, Daniel Lohmann, Wolfg...