Sciweavers

2698 search results - page 307 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
RTA
2010
Springer
15 years 8 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
COMGEO
2006
ACM
15 years 6 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
BMCBI
2007
197views more  BMCBI 2007»
15 years 6 months ago
Boolean networks using the chi-square test for inferring large-scale gene regulatory networks
Background: Boolean network (BN) modeling is a commonly used method for constructing gene regulatory networks from time series microarray data. However, its major drawback is that...
Haseong Kim, Jae K. Lee, Taesung Park
RTSS
2008
IEEE
16 years 29 days ago
Delay-Aware Period Assignment in Control Systems
We consider the problem of optimal static period assignment for multiple independent control tasks executing on the same CPU. Previous works have assumed that the control performa...
Enrico Bini, Anton Cervin
IJPRAI
1998
100views more  IJPRAI 1998»
15 years 6 months ago
Obtaining The Correspondence between Bayesian and Neural Networks
We present in this paper a novel method for eliciting the conditional probability matrices needed for a Bayesian network with the help of a neural network. We demonstrate how we c...
Athena Stassopoulou, Maria Petrou