4114 search results - page 15 / 823 » Efficient Algorithms for the 2-Center Problems |
149
click to vote
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Our experimental analysis of several popular XPath processors reveals a striking fact: Query evaluation in each of the systems requires time exponential in the size of queries in ...
117
click to vote
IPL
2006
15 years 4 months ago
2006
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
151
click to vote
ECCC
2010
15 years 1 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
158
Voted
JCSS
2002
15 years 3 months ago
2002
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
138
click to vote
TON
2010
14 years 11 months ago
2010
OFDMA is one of the most important modulation and access methods for the future mobile networks. Before transmitting a frame on the downlink, an OFDMA base station has to invoke an...