3211 search results - page 429 / 643 » On the Grundy Number of a Graph |
180
click to vote
EUROCRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
204
click to vote
NIPS
2004
15 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
161
click to vote
PSB
2004
15 years 8 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
222
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
171
click to vote
DM
2007
15 years 6 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...