8695 search results - page 1285 / 1739 » Making the Complex Simple |
137
click to vote
ICIP
1998
IEEE
15 years 9 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...
154
click to vote
ROBOCUP
1999
Springer
15 years 9 months ago
1999
Springer
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
145
click to vote
RT
1999
Springer
15 years 9 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
135
click to vote
SP
1998
IEEE
15 years 9 months ago
1998
IEEE
Current implementations of Java make security decisions by searching the runtime call stack. These systems have attractive security properties, but they have been criticized as be...
125
click to vote
COCO
1998
Springer
15 years 9 months ago
1998
Springer
We define probabilistic martingales based on randomized approximation schemes, and show that the resulting notion of probabilistic measure has several desirable robustness propert...