11565 search results - page 1991 / 2313 » Computing Minimal Mappings |
155
click to vote
CGF
2004
15 years 6 months ago
2004
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries an...
181
click to vote
AEI
2000
15 years 6 months ago
2000
This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loadin...
189
click to vote
CN
2002
15 years 6 months ago
2002
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...
179
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
In real-world environments it usually is difficult to specify target operating conditions precisely, for example, target misclassification costs. This uncertainty makes building ro...
189
click to vote
DAM
2000
15 years 6 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...