Sciweavers

7123 search results - page 63 / 1425
» The Ordered Set of Rough Sets
Sort
View
DCG
1998
80views more  DCG 1998»
13 years 9 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink
SGAI
2007
Springer
14 years 4 months ago
Learning Sets of Sub-Models for Spatio-Temporal Prediction
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
Andrew Bennett, Derek R. Magee
ISSAC
2004
Springer
93views Mathematics» more  ISSAC 2004»
14 years 3 months ago
Finding the smallest image of a set
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
Steve Linton
KR
2010
Springer
14 years 2 months ago
Repair and Prediction (under Inconsistency) in Large Biological Networks with Answer Set Programming
We address the problem of repairing large-scale biological networks and corresponding yet often discrepant measurements in order to predict unobserved variations. To this end, we ...
Martin Gebser, Carito Guziolowski, Mihail Ivanchev...
JCB
2006
91views more  JCB 2006»
13 years 10 months ago
Reverse Engineering Discrete Dynamical Systems from Data Sets with Random Input Vectors
Recently a new algorithm for reverse engineering of biochemical networks was developed by Laubenbacher and Stigler. It is based on methods from computational algebra and finds mos...
Winfried Just