Sciweavers

6142 search results - page 286 / 1229
» The Complexity of Partition Functions
Sort
View
JSCIC
2007
89views more  JSCIC 2007»
15 years 6 months ago
Adjoint Recovery of Superconvergent Linear Functionals from Galerkin Approximations. The One-dimensional Case
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
Bernardo Cockburn, Ryuhei Ichikawa
ISBI
2011
IEEE
14 years 10 months ago
Exact integration of diffusion orientation distribution functions for graph-based diffusion MRI analysis
Graph-based image analysis methods are increasingly being applied to diffusion MRI (dMRI) analysis. Unfortunately, weighting the graph for these methods involves solving a complex...
Brian G. Booth, Ghassan Hamarneh
ASUNAM
2011
IEEE
14 years 6 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...
ICML
2008
IEEE
16 years 7 months ago
ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning
We introduce a boosting framework to solve a classification problem with added manifold and ambient regularization costs. It allows for a natural extension of boosting into both s...
Nicolas Loeff, David A. Forsyth, Deepak Ramachandr...
ISBI
2008
IEEE
16 years 7 months ago
Real-time segmentation of 4D ultrasound by Active Geometric Functions
Four-dimensional ultrasound based on matrix phased array transducers can capture the complex 4D cardiac motion in a complete and real-time fashion. However, the large amount of in...
Qi Duan, Elsa D. Angelini, Shunichi Homma, Andrew ...