2531 search results - page 207 / 507 » Group testing in graphs |
184
click to vote
FCT
2007
Springer
16 years 18 days ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
136
click to vote
FSR
2003
Springer
15 years 11 months ago
2003
Springer
For several years, our research group has been developing methods for automated modeling of 3D environments. In September, 2002, we were given the opportunity to demonstrate our m...
165
click to vote
GW
2003
Springer
15 years 11 months ago
2003
Springer
Many disciplines of multimedia and communication go towards ubiquitous computing and hands free- or no-touch interaction with computers. Application domains in this direction invol...
161
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
This paper introduces the Patent Mining Task of the Seventh NTCIR Workshop and the test collections produced in this task. The task's goal was the classification of research ...
179
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...