207 search results - page 33 / 42 » Run-Time Switching Between Total Order Algorithms |
JVCA
2007
13 years 7 months ago
2007
In this paper, we present an example-based motion synthesis technique. Users can interactively control the virtual character to perform desired actions in any order. The desired a...
HM
2007
Springer
14 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
HPCS
2005
IEEE
14 years 1 months ago
2005
IEEE
— With the principal goal of developing an alternative, relatively simple and tractable pricing framework for accurately reproducing a market implied volatility surface, this pap...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Historically, most radar sensor array processing has been implemented using dedicated and specialized processing systems. This approach was necessary because the algorithm computa...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...