2286 search results - page 320 / 458 » Algorithms for Categorical Equivalence |
140
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
We present an annotation management system for relational databases. In this system, every piece of data in a relation is assumed to have zero or more annotations associated with ...
158
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...
307
click to vote
LCC
1994
15 years 10 months ago
1994
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descripti...
167
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Since testing is inherently incomplete, test selection is of vital importance. Coverage measures evaluate the quality of a test suite and help the tester select test case...
167
click to vote
NIPS
2007
15 years 8 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...