Sciweavers

7840 search results - page 306 / 1568
» On generalized Ramsey numbers
Sort
View
UAI
2001
15 years 8 months ago
Markov Chain Monte Carlo using Tree-Based Priors on Model Structure
We present a general framework for defining priors on model structure and sampling from the posterior using the Metropolis-Hastings algorithm. The key ideas are that structure pri...
Nicos Angelopoulos, James Cussens
NIPS
2003
15 years 8 months ago
Learning with Local and Global Consistency
We consider the general problem of learning from labeled and unlabeled data, which is often called semi-supervised learning or transductive inference. A principled approach to sem...
Dengyong Zhou, Olivier Bousquet, Thomas Navin Lal,...
CCCG
1998
15 years 8 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
WSC
2000
15 years 8 months ago
Ranking and selection for steady-state simulation
We present and evaluate two ranking-and-selection procedures for use in steady-state simulation experiments when the goal is to find which among a finite number of alternative sys...
David Goldsman, William S. Marshall, Seong-Hee Kim...
CASCON
1996
89views Education» more  CASCON 1996»
15 years 8 months ago
A comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been de...
David Grove