12519 search results - page 2133 / 2504 » Approximation Problems Categories |
194
click to vote
PLDI
2011
ACM
14 years 9 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
203
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Many web databases are hidden behind restrictive form-like interfaces which may or may not provide domain information for an attribute. When attribute domains are not available, d...
338
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We present the design, implementation, and evaluation of ArrayStore, a new storage manager for complex, parallel array processing. ArrayStore builds on prior work in the area of m...
173
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
198
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...