Sciweavers

1139 search results - page 129 / 228
» Bounded Ideation Theory
Sort
View
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
13 years 8 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
CVPR
2008
IEEE
14 years 10 months ago
Characterizing the shadow space of camera-light pairs
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
POPL
2005
ACM
14 years 8 months ago
A simple typed intermediate language for object-oriented languages
Traditional class and object encodings are difficult to use in practical type-preserving compilers because of the complexity of the encodings. We propose a simple typed intermedia...
Juan Chen, David Tarditi
STOC
2005
ACM
110views Algorithms» more  STOC 2005»
14 years 8 months ago
Key agreement from weak bit agreement
Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ 2 these bits are equal. ...
Thomas Holenstein
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 8 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic