2127 search results - page 251 / 426 » Computing large matchings fast |
139
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
145
click to vote
HICSS
1994
IEEE
15 years 8 months ago
1994
IEEE
The development of accurate trace-driven simulation models has become a key activity in the design of new high-performance computer systems. Tracedriven simulation is fast) enabli...
149
click to vote
CW
2004
IEEE
15 years 8 months ago
2004
IEEE
Shared virtual worlds require exchanging shape models over the Internet. Since complex shapes such as VRML objects are often defined with polygonal meshes, the size of models may ...
132
click to vote
NIPS
2004
15 years 5 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
148
click to vote
IJSM
2006
15 years 4 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 ...