Sciweavers

2322 search results - page 315 / 465
» On a game in directed graphs
Sort
View
IPPS
2007
IEEE
16 years 21 days ago
Minimum number of wavelengths equals load in a DAG without internal cycle
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
Jean-Claude Bermond, Michel Cosnard
AUIC
2005
IEEE
16 years 1 days ago
Real-time 3D Finger Pointing for an Augmented Desk
The augmented desk is gaining popularity in recent HCI research. Its layout of a large horizontal screen on the desk enhances immersive and intense collaborative experiences. A re...
Le Song, Masahiro Takatsuka
INFOCOM
2010
IEEE
15 years 4 months ago
Deploying Mesh Nodes under Non-Uniform Propagation
Abstract—Wireless mesh networks are popular as a costeffective means to provide broadband connectivity to large user populations. A mesh network placement provides coverage, such...
Joshua Robinson, Mohit Singh, Ram Swaminathan, Edw...
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
16 years 6 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
CSL
2007
Springer
16 years 17 days ago
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Dale Miller, Alexis Saurin