5084 search results - page 951 / 1017 » Proving Possibility Properties |
107
click to vote
TKDE
2011
14 years 7 months ago
2011
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
123
click to vote
TIT
2010
14 years 7 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
140
Voted
LOGCOM
2011
14 years 3 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
138
Voted
NETWORKS
2011
14 years 3 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
123
click to vote
CCS
2011
ACM
14 years 18 days ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...