5606 search results - page 623 / 1122 » Randomization Techniques for Graphs. |
176
click to vote
EMSOFT
2008
Springer
15 years 8 months ago
2008
Springer
C's volatile qualifier is intended to provide a reliable link between operations at the source-code level and operations at the memorysystem level. We tested thirteen product...
191
click to vote
WSC
1997
15 years 8 months ago
1997
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
207
click to vote
EOR
2010
15 years 7 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
174
click to vote
CORR
2007
Springer
15 years 7 months ago
2007
Springer
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
208
click to vote
IPM
2007
15 years 7 months ago
2007
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...