1951 search results - page 88 / 391 » An algorithm for improving graph partitions |
132
click to vote
TVCG
2010
14 years 11 months ago
2010
Abstract--One important bottleneck when visualizing large data sets is the data transfer between processor and memory. Cacheaware (CA) and cache-oblivious (CO) algorithms take into...
159
click to vote
VISSYM
2003
15 years 5 months ago
2003
Extracting only the visible portion of an isosurface can improve both the computation efficiency and the rendering speed. However, the visibility test overhead can be quite high ...
147
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
140
click to vote
CIKM
2001
Springer
15 years 8 months ago
2001
Springer
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
183
click to vote
ESA
2011
Springer
14 years 4 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...