Sciweavers

613 search results - page 90 / 123
» Finding and Fixing Faults
Sort
View
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 3 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
UAI
2004
15 years 3 months ago
On the Choice of Regions for Generalized Belief Propagation
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
Max Welling
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 3 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
MVA
1990
139views Computer Vision» more  MVA 1990»
15 years 3 months ago
Generation of 3-D Models Based on Image Fusion of Range Data
This paper presents a method for measuringthe entire three dimensional (3D) shape of object, which is applicable for 3D digitizing into a solid modeling CAD. The method measures t...
Yasuo Sakaguchi, Hirokazu Kato, Kosuke Sato, Seiji...
WCE
2007
15 years 3 months ago
A Comparison of Classification Techniques for Technical Text Passages
— Our work explores the use of several text categorization techniques for classification of manufacturing quality defect and service shop data sets into fixed categories. Althoug...
Mark M. Kornfein, Helena Goldfarb