Sciweavers

200 search results - page 19 / 40
» What Graphs can be Efficiently Represented by BDDs
Sort
View
VISUALIZATION
1999
IEEE
13 years 11 months ago
Image Graphs - A Novel Approach to Visual Data Exploration
For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a vi...
Kwan-Liu Ma
IPPS
2006
IEEE
14 years 1 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
ACCV
2010
Springer
13 years 2 months ago
Linear Solvability in the Viewing Graph
The Viewing Graph [1] represents several views linked by the corresponding fundamental matrices, estimated pairwise. Given a Viewing Graph, the tuples of consistent camera matrices...
Alessandro Rudi, Matia Pizzoli, Fiora Pirri
AAAI
2008
13 years 9 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
JMLR
2010
148views more  JMLR 2010»
13 years 2 months ago
Approximate Inference on Planar Graphs using Loop Calculus and Belief Propagation
We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006b) allows to expre...
Vicenç Gómez, Hilbert J. Kappen, Mic...