664 search results - page 99 / 133 » Some results for a class of generalized polynomials |
135
click to vote
CIKM
2010
Springer
15 years 17 days ago
2010
Springer
This paper introduces the notion of temporally constrained ranked retrieval, which, given a query and a time constraint, produces the best possible ranked list within the specifi...
114
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
112
click to vote
WINE
2009
Springer
15 years 8 months ago
2009
Springer
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
117
click to vote
PKC
2010
Springer
15 years 3 months ago
2010
Springer
We study the problem of integer factoring given implicit information of a special kind. The problem is as follows: let N1 = p1q1 and N2 = p2q2 be two RSA moduli of same bit-size, w...
110
click to vote
ECCC
2006
15 years 2 months ago
2006
We consider the problem of amplifying uniform average-case hardness of languages in NP, where hardness is with respect to BPP algorithms. We introduce the notion of monotone error...