7150 search results - page 96 / 1430 » An Approximation Algorithm for Approximation Rank |
176
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
170
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
102
click to vote
WINE
2007
Springer
15 years 8 months ago
2007
Springer
We consider a crucial aspect of displaying advertisements on the internet: the individual user. In particular, we consider ad fatigue, where a user tires of an advertisement as it ...
WG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
108
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we consider the problem of throughput maximization in an infrastructure based WLAN. We demonstrate that most of the proposed protocols though perform optimally for ...