1127 search results - page 57 / 226 » Testing the Expansion of a Graph |
172
Voted
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Test collections are the primary drivers of progress in information retrieval. They provide a yardstick for assessing the effectiveness of ranking functions in an automatic, rapi...
116
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter...
137
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
117
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
174
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...