16843 search results - page 244 / 3369 » On Generalized Authorization Problems |
198
click to vote
Presentation
This presentation was given as part of theory seminars @ Dept of CSA, Indian Institute of Science, Bangalore. This talk explains about assignment problem and why mechanism design i...
171
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
144
click to vote
ECIS
2001
15 years 8 months ago
2001
The Internet and Intranet reduce much of the costs of information sharing, but they do not solve receivers' reading and interpretation limitations. Alternatively, browsers an...
180
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
133
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...