5214 search results - page 237 / 1043 » The Online Specialization Problem |
159
click to vote
COMPGEOM
1995
ACM
15 years 9 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
162
click to vote
DAM
2008
15 years 6 months ago
2008
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
187
click to vote
WINE
2010
Springer
15 years 3 months ago
2010
Springer
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
133
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
176
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Sponsored search is one of the enabling technologies for today's Web search engines. It corresponds to matching and showing ads related to the user query on the search engine...