86 search results - page 15 / 18 » Worst-Case Running Times for Average-Case Algorithms |
139
click to vote
CCCG
2010
15 years 3 months ago
2010
In this paper we consider a natural extension of the socalled reverse facility location problem which was introduced by Cabello et al. [3]. Given a set of n users and a set of m f...
103
Voted
ICDT
2010
ACM
15 years 19 days ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
177
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
129
click to vote
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
106
click to vote
JDA
2011
14 years 8 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...