Sciweavers

2069 search results - page 195 / 414
» Linear time algorithms for Clobber
Sort
View
FOCS
1994
IEEE
15 years 10 months ago
Expander Codes
Sipser and Spielman have introduced a constructive family of asymptotically good linear error-correcting codes--expander codes--together with a simple parallel algorithm that will ...
Michael Sipser, Daniel A. Spielman
ESA
2000
Springer
122views Algorithms» more  ESA 2000»
15 years 10 months ago
Minimum Depth Graph Embedding
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...
Maurizio Pizzonia, Roberto Tamassia
DAM
2007
103views more  DAM 2007»
15 years 6 months ago
The stable fixtures problem - A many-to-many extension of stable roommates
We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time a...
Robert W. Irving, Sandy Scott
CDC
2010
IEEE
134views Control Systems» more  CDC 2010»
15 years 1 months ago
Nonlinear state-dependent delay modeling and stability analysis of internet congestion control
It is shown that the queuing delay involved in the congestion control algorithm is state-dependent and does not depend on the current time. Then, using an accurate formulation for ...
Corentin Briat, Håkan Hjalmarsson, Karl Henr...
TWC
2011
254views more  TWC 2011»
15 years 1 months ago
Blind Channel Estimation for STBC Systems Using Higher-Order Statistics
—This paper describes a new blind channel estimation algorithm for Space-Time Block Coded (STBC) systems. The proposed method exploits the statistical independence of sources bef...
Vincent Choqueuse, Ali Mansour, Gilles Burel, Ludo...