Sciweavers

5606 search results - page 175 / 1122
» Randomization Techniques for Graphs.
Sort
View
102
Voted
CSDA
2010
118views more  CSDA 2010»
15 years 22 days ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
APVIS
2004
15 years 2 months ago
Graph Interaction through Force-Based Skeletal Animation
Skeletal animation is a concept that has been used in the areas of motion pictures and computer games to create realistic motion for the animation of articulated characters. Recen...
Colin Murray, Damian Merrick, Masahiro Takatsuka
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
15 years 6 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
108
Voted
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 6 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
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...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
115
Voted
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
15 years 6 months ago
Functional Coverage Driven Test Generation for Validation of Pipelined Processors
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
Prabhat Mishra, Nikil D. Dutt