Sciweavers

3991 search results - page 550 / 799
» Bounding homogeneous models
Sort
View
130
Voted
ICML
2010
IEEE
15 years 5 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
151
Voted
ICASSP
2010
IEEE
15 years 4 months ago
Kronecker product matrices for compressive sensing
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
Marco F. Duarte, Richard G. Baraniuk
ADHOC
2008
78views more  ADHOC 2008»
15 years 4 months ago
Asymptotic uniform data-rate guarantees in large wireless networks
In this paper, we study asymptotic uniform data-rate guarantees in large wireless networks from an information-theoretic viewpoint. We consider the following question: what is the...
Xin Liu, R. Srikant
141
Voted
AIEDAM
2008
127views more  AIEDAM 2008»
15 years 4 months ago
Evolving blackbox quantum algorithms using genetic programming
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...
Ralf Stadelhofer, Wolfgang Banzhaf, Dieter Suter
AUTOMATICA
2008
79views more  AUTOMATICA 2008»
15 years 4 months ago
Robust filtering for uncertain linear discrete-time descriptor systems
This paper is concerned with the problem of robust filtering for uncertain linear discrete-time descriptor systems. The matrices of the system state-space model are uncertain, bel...
Carlos E. de Souza, Karina A. Barbosa, Minyue Fu