4536 search results - page 375 / 908 » Contention-Sensitive Data Structures and Algorithms |
208
click to vote
ICDE
2010
IEEE
16 years 4 days ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
193
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
145
click to vote
PARCO
2003
15 years 8 months ago
2003
The relation between autonomous and communication phases determines the throughput of parallel structured information processing systems. Such a relation depends on the algorithm w...
203
click to vote
FUIN
2006
15 years 6 months ago
2006
Wadler's deforestation algorithm eliminates intermediate data structures from functional programs. To be suitable for inclusion in a compiler, it must terminate on all progra...
190
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Even if the class label information is unknown, side information represents some equivalence constraints between pairs of patterns, indicating whether pairs originate from the sam...