2487 search results - page 413 / 498 » cases 2009 |
135
Voted
ALENEX
2009
15 years 2 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
177
Voted
CTRSA
2011
Springer
14 years 7 months ago
2011
Springer
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
176
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
138
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
of proposed research. A short bibliography is optional. Domain theory has been developed around 40 years since 1970s by D. Scott, and S. Abramsky revealed the "junction betwee...
152
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...