350 search results - page 23 / 70 » Lower and upper bounds on obtaining history independence |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
102
click to vote
ICDE
2006
IEEE
15 years 5 months ago
2006
IEEE
Semantic validation of the effectiveness of a schema matching system is traditionally performed by comparing system-generated mappings with those of human evaluators. The human ef...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
103
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We obtain a tight distribution-specific characterization of the sample complexity of large-margin classification with L2 regularization: We introduce the -adapted-dimension, which...