Sciweavers

1942 search results - page 6 / 389
» Matroids from modules
Sort
View
SIAMDM
2008
115views more  SIAMDM 2008»
14 years 11 months ago
Rank-Width and Well-Quasi-Ordering
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
Sang-il Oum
COCOON
2005
Springer
15 years 5 months ago
Error-Set Codes and Related Objects
By considering a new metric, Nikov and Nikova defined the class of error-set correcting codes. These codes differ from the errorcorrecting codes in the sense that the minimum dis...
An Braeken, Ventzislav Nikov, Svetla Nikova
EJC
2007
14 years 11 months ago
The structure of the 3-separations of 3-connected matroids II
The authors showed in an earlier paper that there is a tree that displays, up to a natural equivalence, all non-trivial 3-separations of a 3-connected matroid. The purpose of this ...
James G. Oxley, Charles Semple, Geoff Whittle
TCOM
2008
68views more  TCOM 2008»
14 years 11 months ago
MPSK modulated constellation design for differential space-time modulation
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
Qinghua Shi, Q. T. Zhang
102
Voted
BMCBI
2007
182views more  BMCBI 2007»
14 years 12 months ago
EDISA: extracting biclusters from multiple time-series of gene expression profiles
Background: Cells dynamically adapt their gene expression patterns in response to various stimuli. This response is orchestrated into a number of gene expression modules consistin...
Jochen Supper, Martin Strauch, Dierk Wanke, Klaus ...