2570 search results - page 297 / 514 » Fast Algorithms For The Computation Of Ranklets |
139
Voted
IJSM
2006
15 years 3 months ago
2006
Collision detection is a fundamental problem in computer graphics. In this paper, temporal coherence is studied and an algorithm exploiting it for bounding volume hierarchies, is ...
119
Voted
WSC
2000
15 years 5 months ago
2000
The calculation of value-at-risk (VAR) for large portfolios of complex instruments is among the most demanding and widespread computational challenges facing the financial industr...
103
Voted
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
145
Voted
ACCV
1998
Springer
15 years 8 months ago
1998
Springer
One of the important problems related to image analysis and compression is finding repeated structure. Although the focus of this paper is developing digital geometric models and m...
131
Voted
ECAI
2008
Springer
15 years 5 months ago
2008
Springer
Online multiplicative weight-update learning algorithms, such as Winnow, have proven to behave remarkably for learning simple disjunctions with few relevant attributes. The aim of ...