Sciweavers

5809 search results - page 1162 / 1162
» On Quantifying Semantic Information
Sort
View
PPOPP
2012
ACM
12 years 1 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
ICDE
2012
IEEE
269views Database» more  ICDE 2012»
11 years 8 months ago
A Deep Embedding of Queries into Ruby
—We demonstrate SWITCH, a deep embedding of relational queries into RUBY and RUBY on RAILS. With SWITCH, there is no syntactic or stylistic difference between RUBY programs that ...
Torsten Grust, Manuel Mayr
INFOCOM
2012
IEEE
11 years 8 months ago
Network optimization for DHT-based applications
—P2P platforms have been criticized because of the heavy strain that some P2P services can inflict on costly interdomain links of network operators. It is therefore necessary to...
Yi Sun, Yang Richard Yang, Xiaobing Zhang, Yang Gu...
ICDT
2012
ACM
242views Database» more  ICDT 2012»
11 years 8 months ago
Win-move is coordination-free (sometimes)
In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog¬ program and the number of “coordination stages” require...
Daniel Zinn, Todd J. Green, Bertram Ludäscher
« Prev « First page 1162 / 1162 Last » Next »