Sciweavers

14897 search results - page 439 / 2980
» Environment for statistical computing
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Computing the Tutte Polynomial in Vertex-Exponential Time
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
BMCBI
2005
93views more  BMCBI 2005»
15 years 6 months ago
Computing expectation values for RNA motifs using discrete convolutions
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
André Lambert, Matthieu Legendre, Jean-Fred...
CAD
2004
Springer
15 years 6 months ago
Computer modeling approach for microsphere-packed bone scaffold
A computer modeling approach for constructing a three-dimensional microsphere-packed bone graft structure is presented. The modeling approach consists of both geometric and CAD-ba...
Pallavi Lal, Wei Sun
TOMS
2010
106views more  TOMS 2010»
15 years 5 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
FTCGV
2011
122views more  FTCGV 2011»
14 years 10 months ago
Structured Learning and Prediction in Computer Vision
Powerful statistical models that can be learned efficiently from large amounts of data are currently revolutionizing computer vision. These models possess a rich internal structur...
Sebastian Nowozin, Christoph H. Lampert