Sciweavers

27692 search results - page 259 / 5539
» Where is ...
Sort
View
69
Voted
CSDA
2006
107views more  CSDA 2006»
15 years 22 days ago
Optimal confidence interval for the largest normal mean under heteroscedasticity
A two-stage sampling procedure for obtaining an optimal confidence interval for the largest or smallest mean of k independent normal populations is proposed, where the population ...
Hubert J. Chen, Miin-Jye Wen
90
Voted
DAM
2006
81views more  DAM 2006»
15 years 22 days ago
The satisfactory partition problem
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
84
Voted
DAM
2006
116views more  DAM 2006»
15 years 22 days ago
Using graphs for some discrete tomography problems
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
Marie-Christine Costa, Dominique de Werra, Christo...
DAM
2006
113views more  DAM 2006»
15 years 22 days ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
101
Voted
DM
2006
124views more  DM 2006»
15 years 22 days ago
Hall ratio of the Mycielski graphs
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
Mathew Cropper, András Gyárfá...