848 search results - page 33 / 170 » Randomness and the linear degrees of computability |
237
click to vote
Lecture Notes
Comparing systems using measurement, simulation, and queueing models. Common mistakes and how to avoid them, selection of techniques and metrics, art of data presentation, summariz...
138
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
114
click to vote
HAPTICS
2009
IEEE
15 years 6 months ago
2009
IEEE
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
118
click to vote
VLSM
2005
Springer
15 years 5 months ago
2005
Springer
We present a computationally efficient segmentationrestoration method, based on a probabilistic formulation, for the joint estimation of the label map (segmentation) and the para...
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...