1000 search results - page 106 / 200 » Dependency Tree Automata |
132
click to vote
SAC
2011
ACM
14 years 3 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
95
Voted
RT
1999
Springer
15 years 5 months ago
1999
Springer
This paper presents a ray tracer that facilitates near-interactive scene editing with incremental rendering; the user can edit the scene both by manipulating objects and by changin...
132
Voted
AI
2006
Springer
15 years 27 days ago
2006
Springer
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
138
Voted
CGF
2010
14 years 11 months ago
2010
Recent advances in GPU programmability and architecture have allowed for the generation of ray casted or ray traced images at interactive rates. How quickly these images can be ge...
104
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...