Sciweavers

52 search results - page 8 / 11
» Generalized ERSS tree model: Revisiting working sets
Sort
View
MICCAI
2007
Springer
15 years 10 months ago
Deformable Density Matching for 3D Non-rigid Registration of Shapes
There exists a large body of literature on shape matching and registration in medical image analysis. However, most of the previous work is focused on matching particular sets of f...
Arunabha S. Roy, Ajay Gopinath, Anand Rangarajan
NIPS
2008
14 years 11 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould
FOCS
2005
IEEE
15 years 3 months ago
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Sing...
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
14 years 10 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
FOCS
2008
IEEE
15 years 4 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...