1729 search results - page 86 / 346 » Bound Graph Polysemy |
149
click to vote
JAIR
2010
15 years 3 months ago
2010
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
131
click to vote
FOCS
1993
IEEE
15 years 9 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
137
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
133
click to vote
RFIDSEC
2010
15 years 3 months ago
2010
RFID authentication protocols are susceptible to different types of relay attacks such as mafia and distance frauds. A countermeasure against these types of attacks are the well-...
137
click to vote
JAPLL
2008
15 years 5 months ago
2008
A circle graph is the intersection graph of a set of chords of a circle. If a circle graph is prime for the split (or join) decomposition defined by Cunnigham, it has a unique rep...