1132 search results - page 68 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
188
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
161
click to vote
DCC
2010
IEEE
16 years 1 months ago
2010
IEEE
Channel-optimized index assignment of source codewords is arguably the simplest way of improving transmission error resilience, while keeping the source and/or channel codes intac...
169
click to vote
ICDE
2006
IEEE
16 years 10 days 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...
147
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
175
click to vote
ALT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of inferring the most likely social network given connectivity constraints imposed by observations of outbreaks within the network. Given a set of vertices ...