Sciweavers

253 search results - page 35 / 51
» Data structures in Java for matrix computations
Sort
View
CVPR
2007
IEEE
16 years 6 months ago
Element Rearrangement for Tensor-Based Subspace Learning
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
Shuicheng Yan, Dong Xu, Stephen Lin, Thomas S. Hua...
119
Voted
LICS
2009
IEEE
15 years 10 months ago
Logics with Rank Operators
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...
IPPS
2003
IEEE
15 years 9 months ago
Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing
Partial reconfiguration allows for mapping and executing several tasks on an FPGA during runtime. Multitasking on FPGAs raises a number of questions on the management of the reco...
Herbert Walder, Christoph Steiger, Marco Platzner
128
Voted
ICPR
2010
IEEE
15 years 1 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
ICPR
2008
IEEE
16 years 5 months ago
Approximating a non-homogeneous HMM with Dynamic Spatial Dirichlet Process
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
Haijun Ren, Leon N. Cooper, Liang Wu, Predrag Nesk...