Sciweavers

550 search results - page 89 / 110
» Supporting plan authoring and analysis
Sort
View
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
14 years 7 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
CHI
2006
ACM
16 years 4 months ago
Talk to me: foundations for successful individual-group interactions in online communities
People come to online communities seeking information, encouragement, and conversation. When a community responds, participants benefit and become more committed. Yet interactions...
Jaime Arguello, Brian S. Butler, Elisabeth Joyce, ...
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
16 years 4 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
WMPI
2004
ACM
15 years 10 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
CCS
2008
ACM
15 years 6 months ago
SNAPP: stateless network-authenticated path pinning
This paper examines a new building block for next-generation networks: SNAPP, or Stateless Network-Authenticated Path Pinning. SNAPP-enabled routers securely embed their routing d...
Bryan Parno, Adrian Perrig, Dave Andersen