211 search results - page 40 / 43 » How to present a paper in theoretical computer science: a sp... |
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
DIS
2007
Springer
14 years 1 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
ACSC
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we shall introduce a new electronic payment concept based on the popular direct debit payment model, entitled periodical payments. The direct debit model currently i...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...