Sciweavers

750 search results - page 76 / 150
» Reconstruction for Models on Random Graphs
Sort
View
SMA
2008
ACM
192views Solid Modeling» more  SMA 2008»
14 years 10 months ago
Identification of sections from engineering drawings based on evidence theory
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
Jie-Hui Gong, Hui Zhang, Bin Jiang, Jia-Guang Sun
BMVC
2001
15 years 2 months ago
Graph Matching using Adjacency Matrix Markov Chains
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...
Antonio Robles-Kelly, Edwin R. Hancock
DICS
2006
15 years 3 months ago
Fault-Tolerant Parallel Applications with Dynamic Parallel Schedules: A Programmer's Perspective
Dynamic Parallel Schedules (DPS) is a flow graph based framework for developing parallel applications on clusters of workstations. The DPS flow graph execution model enables automa...
Sebastian Gerlach, Basile Schaeli, Roger D. Hersch
EMNLP
2009
14 years 9 months ago
Graphical Models over Multiple Strings
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
Markus Dreyer, Jason Eisner
MSWIM
2004
ACM
15 years 5 months ago
Quantile models for the threshold range for k-connectivity
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
Henri Koskinen