Sciweavers

151 search results - page 18 / 31
» Computing in Solvable Matrix Groups
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Latency-constrained low-complexity lattice reduction for MIMO-OFDM systems
Recent studies have investigated lattice-reduction (LR) preprocessing technique for multiple-inputmultiple-output (MIMO) detection. However, if LR is applied to the orthogonalfreq...
Chun-Fu Liao, Fang-Chun Lan, Yuan-Hao Huang, Po-Li...
AI
2006
Springer
13 years 9 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
ECCV
2006
Springer
14 years 11 months ago
Region Covariance: A Fast Descriptor for Detection and Classification
We describe a new region descriptor and apply it to two problems, object detection and texture classification. The covariance of d-features, e.g., the three-dimensional color vecto...
Oncel Tuzel, Fatih Porikli, Peter Meer
CVPR
2008
IEEE
14 years 11 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal
ICCV
2001
IEEE
14 years 11 months ago
Segmentation with Pairwise Attraction and Repulsion
We propose a method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues. These two kinds of pairw...
Stella X. Yu, Jianbo Shi