5606 search results - page 416 / 1122 » Randomization Techniques for Graphs. |
175
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tiling has long been used to improve cache performance. Recursion has recently been used as a cache-oblivious method of improving cache performance. Both of these techniques are n...
167
click to vote
INFOVIS
2000
IEEE
15 years 11 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
155
click to vote
ENTCS
2007
15 years 6 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
145
click to vote
ACIVS
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we consider an object categorization system using local HMAX features. Two feature matching techniques are compared: the MAX technique, originally proposed in the HMA...
167
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...