1274 search results - page 15 / 255 » New Proofs for |
APWEB
2007
Springer
14 years 1 months ago
2007
Springer
How can a RFID (Radio Frequency Identification Devices) system prove that two or more RFID tags are in the same location? Previous researchers have proposed yoking-proof and groupi...
IPL
2002
13 years 7 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
AAECC
2002
Springer
13 years 7 months ago
2002
Springer
A fruitful interaction between a new randomized WZ procedure and other computer algebra programs is illustrated by the computer proof of a series evaluation that originates from a ...
WECWIS
2005
IEEE
14 years 1 months ago
2005
IEEE
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
LPAR
2004
Springer
14 years 27 days ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...