1830 search results - page 82 / 366 » Workshop on Graph Computation Models |
130
click to vote
WG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
146
click to vote
EUROCRYPT
2008
Springer
15 years 6 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...
140
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
166
click to vote
SAC
2002
ACM
15 years 3 months ago
2002
ACM
We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad hoc networks. Three components of thi...
135
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
In this paper we present a dynamic model for simulating face aging process. We adopt a high resolution grammatical face model[1] and augment it with age and hair features. This mo...