Sciweavers

1497 search results - page 192 / 300
» A Computational Model for Message Passing
Sort
View
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 8 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
OOPSLA
2010
Springer
13 years 6 months ago
Cross-language, type-safe, and transparent object sharing for co-located managed runtimes
As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming langua...
Michal Wegiel, Chandra Krintz
APSEC
2000
IEEE
14 years 17 days ago
Component-based application development on architecture of a model, UI and components
Explosive increase in end-user computing on distributed systems requires that end-users develop application software by themselves. One solution is given as a formula of “a doma...
Takeshi Chusho, Hisashi Ishigure, Naoyuki Konda, T...
ICWS
2009
IEEE
14 years 5 months ago
A Tool for Choreography Analysis Using Collaboration Diagrams
Analyzing interactions among peers that interact via messages is a crucial problem due to increasingly distributed nature of current software systems, especially the ones built us...
Tevfik Bultan, Chris Ferguson, Xiang Fu
APPROX
2011
Springer
272views Algorithms» more  APPROX 2011»
12 years 8 months ago
Public Key Locally Decodable Codes with Short Keys
This work considers locally decodable codes in the computationally bounded channel model. The computationally bounded channel model, introduced by Lipton in 1994, views the channe...
Brett Hemenway, Rafail Ostrovsky, Martin J. Straus...