205 search results - page 25 / 41 » Efficient Algorithms for Universal Portfolios |
STOC
2003
ACM
16 years 6 hour ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
113
click to vote
TSP
2010
14 years 6 months ago
2010
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
190
click to vote
ICDE
2003
IEEE
16 years 1 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...
CADE
2004
Springer
16 years 16 hour ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
177
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
Skyline query processing has been investigated extensively in recent years, mostly for only one query reference point. An example of a single-source skyline query is to find hotel...