5100 search results - page 964 / 1020 » The Linear Complexity of a Graph |
180
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
169
click to vote
COCO
1994
Springer
15 years 8 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
151
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
204
click to vote
AII
1992
15 years 8 months ago
1992
Most theoretical models of inductive inference make the idealized assumption that the data available to a learner is from a single and accurate source. The subject of inaccuracies ...
181
click to vote
ERSHOV
2009
Springer
15 years 8 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...