6575 search results - page 437 / 1315 » Specializing visualization algorithms |
163
click to vote
ORL
2008
15 years 6 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
199
click to vote
CAD
1999
Springer
15 years 6 months ago
1999
Springer
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
173
click to vote
MA
2011
Springer
15 years 1 months ago
2011
Springer
We consider the problem minx(x−t) A(x−t) subject to x Bx + 2b x = k where A is positive definite or positive semidefinite. Commonly occurring statistical variants of this pro...
170
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
It is well known that LDPC decoding is computationally demanding and one of the hardest signal operations to parallelize. Beyond data dependencies that restrict the decoding of a ...
219
click to vote
VIS
2004
IEEE
16 years 8 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...