1199 search results - page 177 / 240 » Parameterized Proof Complexity |
CORR
2007
Springer
15 years 24 days ago
2007
Springer
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
105
Voted
JOLLI
2006
15 years 23 days ago
2006
We propose a novel interpretation of natural-language questions using a modal predicate logic of knowledge. Our approach brings standard model-theoretic and proof-theoretic techniq...
104
Voted
EOR
2007
15 years 23 days ago
2007
Consider a single machine and a set of jobs that are available for processing at time 0. Job ¡ has a processing time ¢¤£ , a due date ¥¦£ and a weight §¨£ . We consid...
97
Voted
JCB
2007
15 years 21 days ago
2007
The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome...
115
click to vote
JALC
2002
15 years 14 days ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...