1492 search results - page 106 / 299 » Testing Properties of Constraint-Graphs |
144
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
127
Voted
RSA
2006
15 years 3 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
148
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We measure the WT10g test collection, used in the TREC-9 and TREC 2001 Web Tracks, and the .GOV test collection used in the TREC 2002 Web and Interactive Tracks, with common measu...
148
click to vote
SMC
2010
IEEE
15 years 2 months ago
2010
IEEE
—This study examines the ability of nonnegative matrix factorization (NMF) as a method for constructing semantic spaces, in which the meaning of each word is represented by a hig...
115
Voted
SIGSOFT
2010
ACM
15 years 1 months ago
2010
ACM
Reliance on skilled developers reduces the return on investment for important software engineering tasks such as establishing program correctness. This position paper introduces a...