183 search results - page 29 / 37 » Linear-Time Algorithms in Memory Hierarchies |
107
click to vote
SIGSOFT
2007
ACM
15 years 10 months ago
2007
ACM
Code clones are similar code fragments that occur at multiple locations in a software system. Detection of code clones provides useful information for maintenance, reengineering, ...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
TROB
2008
14 years 8 months ago
2008
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
102
Voted
ISPDC
2010
IEEE
14 years 8 months ago
2010
IEEE
—Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi- ...
PODS
2006
ACM
15 years 9 months ago
2006
ACM
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...