2218 search results - page 116 / 444 » Testing Expressibility Is Hard |
GFKL
2005
Springer
14 years 2 months ago
2005
Springer
Mixture models represent results of gene expression cluster analysis in a more natural way than ’hard’ partitions. This is also true for the representation of gene labels, such...
ICDIM
2007
IEEE
13 years 11 months ago
2007
IEEE
We consider the problem of data durability in lowbandwidth large-scale distributed storage systems. Given the limited bandwidth between replicas, these systems suffer from long re...
SEMWEB
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
IJCV
2000
13 years 9 months ago
2000
Optical flow provides a constraint on the motion of a deformable model. We derive and solve a dynamic system incorporating flow as a hard constraint, producing a model-based least...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...