Sciweavers

2593 search results - page 305 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
117
Voted
CORR
2010
Springer
173views Education» more  CORR 2010»
15 years 2 months ago
CONCISE: Compressed 'n' Composable Integer Set
Bit arrays, or bitmaps, are used to significantly speed up set operations in several areas, such as data warehousing, information retrieval, and data mining, to cite a few. Howeve...
Alessandro Colantonio, Roberto Di Pietro
ISPAN
1996
IEEE
15 years 6 months ago
Design and evaluation of an environment APE for automatic parallelization of programs
In this paper, we have presented the design and evaluation of a compiler system, called APE,for automatic parallelization of scientific and engineering applications on distributed...
Vipin Chaudhary, Cheng-Zhong Xu, Sumit Roy, Jialin...
ICS
2010
Tsinghua U.
15 years 7 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
119
Voted
ITICSE
2010
ACM
15 years 4 months ago
What did qubits ever do for me: an answer for CS2 students
We show how to teach and motivate small quantum computer programs as a supplemental topic in a CS2 data structures class. A traditional example such as Shor’s factorization [8] ...
Michael Main, Robert Frohardt, Yingdan Huang
139
Voted
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
16 years 3 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang