Sciweavers

11211 search results - page 10 / 2243
» Rank-Sensitive Data Structures
Sort
View
IJAR
2010
152views more  IJAR 2010»
13 years 8 months ago
Structural-EM for learning PDG models from incomplete data
Probabilistic Decision Graphs (PDGs) are a class of graphical models that can naturally encode some context specific independencies that cannot always be efficiently captured by...
Jens D. Nielsen, Rafael Rumí, Antonio Salme...
USS
2010
13 years 7 months ago
Structuring Protocol Implementations to Protect Sensitive Data
In a bid to limit the harm caused by ubiquitous remotely exploitable software vulnerabilities, the computer systems security community has proposed primitives to allow execution o...
Petr Marchenko, Brad Karp
POPL
2011
ACM
13 years 14 days ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu
EDBT
2012
ACM
306views Database» more  EDBT 2012»
12 years 1 days ago
Clydesdale: structured data processing on MapReduce
MapReduce has emerged as a promising architecture for large scale data analytics on commodity clusters. The rapid adoption of Hive, a SQL-like data processing language on Hadoop (...
Tim Kaldewey, Eugene J. Shekita, Sandeep Tata
FAST
2011
13 years 1 months ago
Consistent and Durable Data Structures for Non-Volatile Byte-Addressable Memory
The predicted shift to non-volatile, byte-addressable memory (e.g., Phase Change Memory and Memristor), the growth of “big data”, and the subsequent emergence of frameworks su...
Shivaram Venkataraman, Niraj Tolia, Parthasarathy ...