Sciweavers

971 search results - page 91 / 195
» Approximate Satisfiability and Equivalence
Sort
View
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 22 days ago
Counting good truth assignments of random k-SAT formulae
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...
Andrea Montanari, Devavrat Shah
102
Voted
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
14 years 11 months ago
Maintaining connectivity in environments with obstacles
Abstract— Robotic routers (mobile robots with wireless communication capabilities) can create an adaptive wireless network and provide communication services for mobile users ond...
Onur Tekdas, Patrick A. Plonski, Nikhil Karnad, Vo...
114
Voted
FSTTCS
2010
Springer
14 years 10 months ago
Combinatorial Problems with Discounted Price Functions in Multi-agent Systems
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
Gagan Goel, Pushkar Tripathi, Lei Wang
100
Voted
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
16 years 1 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
89
Voted
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
16 years 14 days ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos