13987 search results - page 532 / 2798 » The Two Guards Problem |
158
click to vote
ENTCS
2008
15 years 7 months ago
2008
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasse...
173
click to vote
DM
2006
15 years 7 months ago
2006
Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last...
182
click to vote
ECCC
2006
15 years 7 months ago
2006
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
178
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
200
click to vote
PERCOM
2008
ACM
15 years 7 months ago
2008
ACM
RFID technology shall increase security, e.g. by helping to prevent counterfeiting. But the technology also causes privacy issues. In this paper, after highlighting goals and prob...