6251 search results - page 357 / 1251 » Randomness, Computability, and Density |
152
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
173
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
168
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
186
click to vote
PDP
2007
IEEE
16 years 1 months ago
2007
IEEE
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
175
click to vote
DAWAK
2007
Springer
16 years 27 days ago
2007
Springer
We propose a privacy-preserving protocol for computing aggregation queries over the join of private tables. In this problem, several parties wish to share aggregated information ov...