1632 search results - page 248 / 327 » Sublinear Time Algorithms for Metric Space Problems |
134
Voted
RSCTC
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
167
Voted
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
124
Voted
CPHYSICS
2004
15 years 3 months ago
2004
We introduce here a new method for the numerical resolution of the Vlasov equation on a phase space grid using an adaptive semi-Lagrangian method. The adaptivity is obtained throu...
143
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
113
Voted
APPROX
2007
Springer
15 years 7 months ago
2007
Springer
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...