Sciweavers

2498 search results - page 273 / 500
» Data Structures with Unpredictable Timing
Sort
View
FORTE
2004
15 years 8 months ago
Symbolic Performance and Dependability Evaluation with the Tool CASPA
This paper describes the tool CASPA, a new performance evaluation tool which is based on a Markovian stochastic process algebra. CASPA uses multi-terminal binary decision diagrams ...
Matthias Kuntz, Markus Siegle, Edith Werner
NIPS
2001
15 years 8 months ago
Partially labeled classification with Markov random walks
To classify a large number of unlabeled examples we combine a limited number of labeled examples with a Markov random walk representation over the unlabeled examples. The random w...
Martin Szummer, Tommi Jaakkola
IJCAI
2003
15 years 8 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
CCCG
1993
15 years 7 months ago
Maintaining the Approximate Width of a Set of Points in the Plane
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
Günter Rote, Christian Schwarz, Jack Snoeyink
SOFSEM
2010
Springer
15 years 4 months ago
Fast and Compact Prefix Codes
It is well-known that, given a probability distribution over n characters, in the worst case it takes (n log n) bits to store a prefix code with minimum expected codeword length. H...
Travis Gagie, Gonzalo Navarro, Yakov Nekrich