Sciweavers

2563 search results - page 154 / 513
» Parallel matrix algorithms and applications
Sort
View
110
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Sparsity-cognizant overlapping co-clustering for behavior inference in social networks
Co-clustering can be viewed as a two-way (bilinear) factorization of a large data matrix into dense/uniform and possibly overlapping submatrix factors (co-clusters). This combinat...
Hao Zhu, Gonzalo Mateos, Georgios B. Giannakis, Ni...
146
Voted
AUTOMATICA
2006
104views more  AUTOMATICA 2006»
15 years 4 months ago
Optimal sensor placement and motion coordination for target tracking
This work studies optimal sensor placement and motion coordination strategies for mobile sensor networks. For a target tracking application with range sensors, we investigate the ...
Sonia Martínez, Francesco Bullo
IJFCS
2006
70views more  IJFCS 2006»
15 years 3 months ago
The Computational Complexity of Avoiding Forbidden Submatrices by Row Deletions
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
Sebastian Wernicke, Jochen Alber, Jens Gramm, Jion...
110
Voted
JSC
2011
74views more  JSC 2011»
14 years 11 months ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
AGI
2011
14 years 7 months ago
Nonlinear-Dynamical Attention Allocation via Information Geometry
Inspired by a broader perspective viewing intelligent system dynamics in terms of the geometry of “cognitive spaces,” we conduct a preliminary investigation of the application ...
Matthew Iklé, Ben Goertzel