Sciweavers

61 search results - page 2 / 13
» On the Number of Graphical Forest Partitions
Sort
View
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 4 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
FOCS
2006
IEEE
13 years 11 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt
SIGGRAPH
1998
ACM
13 years 9 months ago
Progressive Forest Split Compression
In this paper we introduce the Progressive Forest Split (PFS) representation, a new adaptive refinement scheme for storing and transmitting manifold triangular meshes in progress...
Gabriel Taubin, André Guéziec, Willi...
ENVSOFT
2000
51views more  ENVSOFT 2000»
13 years 4 months ago
Simulation of nitrous oxide and nitric oxide emissions from tropical primary forests in the Costa Rican Atlantic Zone
Nitrous oxide (N2O) and nitric oxide (NO) are important atmospheric trace gases participating in the regulation of global climate and environment. Predictive models on the emissio...
Shuguang Liu, William A. Reiners, Michael Keller, ...
EGH
2004
Springer
13 years 8 months ago
Efficient partitioning of fragment shaders for multiple-output hardware
Partitioning fragment shaders into multiple rendering passes is an effective technique for virtualizing shading resource limits in graphics hardware. The Recursive Dominator Split...
Tim Foley, Mike Houston, Pat Hanrahan