2600 search results - page 394 / 520 » Clustering with or without the Approximation |
138
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
149
click to vote
ICIP
1998
IEEE
15 years 10 months ago
1998
IEEE
: While lattice vector quantization (LVQ) can solve the complexity problem of LBG based vector quantizers, and also yield very general codebooks, a single stage lattice VQ, when ap...
182
click to vote
RT
1999
Springer
15 years 10 months ago
1999
Springer
Interactive rendering requires rapid visual feedback. The render cache is a new method for achieving this when using high-quality pixel-oriented renderers such as ray tracing that...
156
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
151
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
: While delay modeling of gates with a single switching input has received considerable attention, the case of multiple inputs switching in close temporal proximity is just beginni...