449 search results - page 76 / 90 » Intention-Disguised Algorithmic Trading |
115
Voted
UAI
1996
15 years 3 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
154
Voted
ECOOP
1998
Springer
15 years 6 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
101
Voted
SIGGRAPH
2010
ACM
15 years 6 months ago
2010
ACM
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...
109
Voted
AAAI
2006
15 years 4 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
146
Voted
VMV
2001
15 years 4 months ago
2001
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...