Sciweavers

1026 search results - page 23 / 206
» On Finding Minimal w-cutset
Sort
View
CDES
2008
130views Hardware» more  CDES 2008»
13 years 10 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
HICSS
2008
IEEE
142views Biometrics» more  HICSS 2008»
13 years 9 months ago
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
Yamin Li, Shietung Peng, Wanming Chu
JGO
2008
83views more  JGO 2008»
13 years 9 months ago
Global minimization of rational functions and the nearest GCDs
This paper discusses the global minimization of rational functions with or without constraints. We studied the sum of squares (SOS) relaxations and their properties to solve this ...
Jiawang Nie, James Demmel, Ming Gu
AAAI
1990
13 years 10 months ago
Probabilistic Semantics for Cost Based Abduction
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
Eugene Charniak, Solomon Eyal Shimony
IWVF
2001
Springer
14 years 1 months ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel