Sciweavers

1538 search results - page 32 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
IWCMC
2006
ACM
14 years 4 months ago
Low complexity design of space-time convolutional codes with high spectral efficiencies
Space time convolutional codes (STCCs) are an effective way to combine transmit diversity with coding. The computational complexity of designing STCCs generally increases exponent...
Kyungmin Kim, Hamid R. Sadjadpour, Rick S. Blum, Y...
CVPR
2008
IEEE
15 years 2 days ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
ICASSP
2009
IEEE
14 years 4 months ago
Two microphone based direction of arrival estimation for multiple speech sources using spectral properties of speech
A two microphone direction of arrival (DOA) estimation technique for multiple speech sources is developed which exploits speech specific properties, namely sparsity in time-frequ...
Wenyi Zhang, Bhaskar D. Rao
ENTCS
2007
110views more  ENTCS 2007»
13 years 10 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano
COR
2011
13 years 5 months ago
On the application of graph colouring techniques in round-robin sports scheduling
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
R. Lewis, J. Thompson