14548 search results - page 262 / 2910 » The Optimal Path-Matching Problem |
183
click to vote
MA
2010
Springer
15 years 5 months ago
2010
Springer
This paper deals with the quantization problem of a random variable X taking values in a separable and re exive Banach space, and with the related question of clustering independ...
177
click to vote
JSA
2000
15 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
144
click to vote
CGF
1998
15 years 6 months ago
1998
Progressive addition lenses are a relatively new approach to compensate for defects of the human visual system. While traditional spectacles use rotationally symmetric lenses, pro...
179
click to vote
TON
2002
15 years 6 months ago
2002
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...
190
click to vote
TVCG
2008
15 years 5 months ago
2008
Mesh parameterization is a fundamental technique in computer graphics. The major goals during mesh parameterization are to minimize both the angle distortion and the area distortio...