Sciweavers

8810 search results - page 1747 / 1762
» Openness
Sort
View
POPL
2011
ACM
14 years 15 days ago
Safe nondeterminism in a deterministic-by-default parallel language
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
PPOPP
2011
ACM
14 years 15 days ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
SFM
2011
Springer
253views Formal Methods» more  SFM 2011»
14 years 15 days ago
Application-Layer Connector Synthesis
The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to coo...
Paola Inverardi, Romina Spalazzese, Massimo Tivoli
SIAMIS
2011
14 years 15 days ago
On the Illumination Invariance of the Level Lines under Directed Light: Application to Change Detection
We analyze the illumination invariance of the level lines of an image. We show that if the scene surface has Lambertian reflectance and the light is directed, then a necessary and...
Pierre Weiss, Alexandre Fournier, Laure Blanc-F&ea...
SIGECOM
2011
ACM
203views ECommerce» more  SIGECOM 2011»
14 years 15 days ago
Polynomial-time computation of exact correlated equilibrium in compact games
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
Albert Xin Jiang, Kevin Leyton-Brown
« Prev « First page 1747 / 1762 Last » Next »