Sciweavers

7123 search results - page 1336 / 1425
» The Ordered Set of Rough Sets
Sort
View
ICS
2010
Tsinghua U.
14 years 28 days ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
GROUP
1993
ACM
14 years 27 days ago
ASCW: an assistant for cooperative work
The Assistant for Cooperative Work (ASCW) is a powerful system for the management of distributed work. It consists of the Task Manager, the organizational information system TOSCA...
Thomas Kreifelts, Wolfgang Prinz
KDD
1994
ACM
125views Data Mining» more  KDD 1994»
14 years 27 days ago
Knowledge Discovery in Large Image Databases: Dealing with Uncertainties in Ground Truth
This paper discusses the problem of knowledge discovery in image databases with particular focus on the issues which arise when absolute ground truth is not available. It is often...
Padhraic Smyth, Michael C. Burl, Usama M. Fayyad, ...
PEPM
1994
ACM
14 years 27 days ago
Partial Evaluation of Numerical Programs in Fortran
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
Romana Baier, Robert Glück, Robert Zöchl...
PODS
1994
ACM
138views Database» more  PODS 1994»
14 years 27 days ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
« Prev « First page 1336 / 1425 Last » Next »