4541 search results - page 797 / 909 » Cache-Oblivious Algorithms and Data Structures |
194
Voted
ALMOB
2006
15 years 6 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
171
click to vote
ICSE
2008
IEEE-ACM
16 years 7 months ago
2008
IEEE-ACM
Several techniques have been developed for identifying similar code fragments in programs. These similar fragments, referred to as code clones, can be used to identify redundant c...
169
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Currently most link-related applications treat all links in the same web page to be identical. One link-related application usually requires one certain property of hyperlinks but...
138
Voted
WWW
2004
ACM
16 years 7 months ago
2004
ACM
The Internet and the World Wide Web have enabled a publishing explosion of useful online information, which has produced the unfortunate side effect of information overload: it is...
186
Voted
MICRO
2009
IEEE
16 years 1 months ago
2009
IEEE
Aggressive technology scaling to 45nm and below introduces serious reliability challenges to the design of microprocessors. Large SRAM structures used for caches are particularly ...