3267 search results - page 482 / 654 » Generalized quasirandom graphs |
181
click to vote
DAGM
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
193
click to vote
EUROCRYPT
2005
Springer
16 years 1 days ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
154
click to vote
PLDI
2004
ACM
15 years 12 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
174
click to vote
PODC
2004
ACM
15 years 12 months ago
2004
ACM
We study a representative task allocation problem called shortest paths: Let G be a graph in which the edges are owned by self interested agents. The cost of each edge is privatel...
165
click to vote
SIGCOMM
2004
ACM
15 years 12 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...