3690 search results - page 462 / 738 » Computation with classical sequents |
180
click to vote
FOCS
2006
IEEE
16 years 24 days ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
190
Voted
FOCS
2006
IEEE
16 years 24 days ago
2006
IEEE
We convert cell-probe lower bounds for polynomial space into stronger lower bounds for near-linear space. Our technique applies to any lower bound proved through the richness meth...
192
click to vote
FOCS
2006
IEEE
16 years 24 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
173
click to vote
ICDCS
2006
IEEE
16 years 23 days ago
2006
IEEE
Publish/Subscribe systems provide a useful platform for delivering data (events) from publishers to subscribers in an anonymous fashion in distributed networks. In this paper, we ...
176
click to vote
ICDM
2006
IEEE
16 years 23 days ago
2006
IEEE
Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privac...