Sciweavers

1058 search results - page 87 / 212
» It's Doomed; We Can Prove It
Sort
View
CCS
2008
ACM
14 years 12 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
PODC
2012
ACM
13 years 9 days ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
LATIN
2010
Springer
14 years 8 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
VLDB
2005
ACM
151views Database» more  VLDB 2005»
15 years 3 months ago
Query Execution Assurance for Outsourced Databases
In this paper we propose and analyze a method for proofs of actual query execution in an outsourced database framework, in which a client outsources its data management needs to a...
Radu Sion
AAAI
2006
14 years 11 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack