Sciweavers

756 search results - page 96 / 152
» A new algorithm for Boolean operations on general polygons
Sort
View
AAECC
2007
Springer
111views Algorithms» more  AAECC 2007»
13 years 9 months ago
When cache blocking of sparse matrix vector multiply works and why
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
Rajesh Nishtala, Richard W. Vuduc, James Demmel, K...
EWC
2011
52views more  EWC 2011»
13 years 4 months ago
Localized coarsening of conforming all-hexahedral meshes
Abstract. Finite element mesh adaptation methods can be used to improve the efficiency and accuracy of solutions to computational modeling problems. In many applications involving ...
Adam C. Woodbury, Jason F. Shepherd, Matthew L. St...
DEBS
2008
ACM
13 years 11 months ago
Extending Siena to support more expressive and flexible subscriptions
This paper defines and discusses the implementation of two novel extensions to the Siena Content-based Network (CBN) to extend it to become a Knowledge-based Network (KBN) thereby...
John Keeney, Dominik Roblek, Dominic Jones, David ...
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
14 years 1 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
TKDE
2012
253views Formal Methods» more  TKDE 2012»
11 years 11 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002