3600 search results - page 211 / 720 » The settling-time reducibility ordering |
182
click to vote
MICRO
1994
IEEE
15 years 10 months ago
1994
IEEE
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
212
click to vote
CIKM
1994
Springer
15 years 10 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
180
click to vote
IGIS
1994
15 years 10 months ago
1994
The basic concept for processing spatial joins consists of two steps: First, the spatial join is performed on the minimum bounding rectangles of the objects by using a spatial acce...
181
click to vote
AFRIGRAPH
2009
ACM
15 years 10 months ago
2009
ACM
Traditionally, levels of detail (LOD) for animated characters are computed from a single pose. Later techniques refined this approach by considering a set of sample poses and eval...
171
click to vote
AIRWEB
2007
Springer
15 years 10 months ago
2007
Springer
The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other ...