Sciweavers

1278 search results - page 164 / 256
» The Complexity of Weighted Boolean
Sort
View
145
Voted
ISBI
2011
IEEE
14 years 7 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
144
Voted
ICALP
2011
Springer
14 years 7 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
145
Voted
AAAI
2011
14 years 3 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
144
Voted
ICDAR
2011
IEEE
14 years 3 months ago
Symbol Recognition by Multiresolution Shape Context Matching
—We present a multiresolution scheme for symbol representation and recognition based on statistical shape features. We define a symbol as a set of shape points, each of which is...
Feng Su, Tong Lu, Ruoyu Yang
162
Voted
CORR
2012
Springer
214views Education» more  CORR 2012»
13 years 11 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos