2621 search results - page 79 / 525 » Near orders and codes |
174
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
167
click to vote
MLQ
2011
14 years 7 months ago
2011
We develop a new method for coding sets while preserving gch in the presence of large cardinals, particularly supercompact cardinals. We will use the number of normal measures carr...
123
click to vote
FCCM
2006
IEEE
15 years 10 months ago
2006
IEEE
: We describe a new pipeline for computing non-bonded forces and its integration into the ProtoMol molecular dynamics (MD) code. There are several innovations: a novel interpolatio...
137
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
116
click to vote
CPAIOR
2005
Springer
15 years 10 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...