683 search results - page 73 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
JVCA
2008
13 years 7 months ago
2008
We propose a method for view-dependent simplification of articulated-body dynamics, which enables an automatic trade-off between visual precision and computational efficiency. We ...
WOSP
1998
ACM
14 years 4 days ago
1998
ACM
Increasingly, new applications are being built by composing existing software components rather than by coding a system from scratch. Using this approach, applications can be buil...
HT
1991
ACM
13 years 11 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
IPPS
1999
IEEE
14 years 5 days ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
PVLDB
2010
13 years 6 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...