Sciweavers

392 search results - page 12 / 79
» Maximal Completion
Sort
View
VTC
2007
IEEE
108views Communications» more  VTC 2007»
14 years 2 months ago
Joint Optimization of Iterative Source and Channel Decoding Using Over-Complete Source-Mapping
— The intentionally imposed or inherent unintentional residual redundancy found in source encoded bitstreams can be exploited for supporting joint SoftBit-Source Decoding and Cha...
Anh Quang Pham, Lie-Liang Yang, Lajos Hanzo
ICDT
2001
ACM
110views Database» more  ICDT 2001»
14 years 5 days ago
On Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relatio...
Chen Li, Edward Y. Chang
RSA
2002
87views more  RSA 2002»
13 years 7 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
ARSCOM
2008
85views more  ARSCOM 2008»
13 years 7 months ago
Minimal blocking sets in PG(2, 9)
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...
Fernanda Pambianco, Leo Storme
IJCAI
2001
13 years 9 months ago
Constraints as Data: A New Perspective on Inferring Probabilities
We present a new approach to inferring a probability distribution which is incompletely specified by a number of linear constraints. We argue that the currently most popular appro...
Manfred Jaeger