Sciweavers

2239 search results - page 76 / 448
» Computing with abstract matrix structures
Sort
View
CC
2008
Springer
15 years 1 months ago
Generating SIMD Vectorized Permutations
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
Franz Franchetti, Markus Püschel
DAGSTUHL
2009
15 years 28 days ago
Median Topographic Maps for Biomedical Data Sets
Abstract. Median clustering extends popular neural data analysis methods such as the self-organizing map or neural gas to general data structures given by a dissimilarity matrix on...
Barbara Hammer, Alexander Hasenfuss, Fabrice Rossi
CVPR
1996
IEEE
16 years 1 months ago
Robust Recovery of Camera Rotation from Three Frames
Computing camera rotation from image sequences can serve many computer vision applications. One direct application is image stabilization, and when the camera rotation is known th...
Benny Rousso, Shai Avidan, Amnon Shashua, Shmuel P...
JCB
2000
87views more  JCB 2000»
14 years 11 months ago
Comparison of Additive Trees Using Circular Orders
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
Vladimir Makarenkov, Bruno Leclerc
TKDE
2012
250views Formal Methods» more  TKDE 2012»
13 years 2 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad