2681 search results - page 294 / 537 » Problem F |
138
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we present GOAFR, a new geometric ad-hoc routing algorithm combining greedy and face routing. We evaluate this algorithm by both rigorous analysis and comprehensive ...
183
click to vote
EDBTW
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the complexity of performing updates on probabilistic XML data for various classes of probabilistic XML documents of different succinctness. We consider two elemen...
158
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
160
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
169
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...