Sciweavers

368 search results - page 10 / 74
» Advanced Computing and Communications Research under NSF Sup...
Sort
View
RECSYS
2009
ACM
14 years 1 months ago
An incentive-based architecture for social recommendations
We present an incentive-based architecture for providing recommendations in a social network. We maintain a distinct reputation system for each individual and we rely on users to ...
Rajat Bhattacharjee, Ashish Goel, Konstantinos Kol...
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 1 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
ICCAD
2004
IEEE
191views Hardware» more  ICCAD 2004»
14 years 4 months ago
Checking consistency of C and Verilog using predicate abstraction and induction
edicate Abstraction and Induction Edmund Clarke Daniel Kroening June 25, 2004 CMU-CS-04-131 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 It is common...
Daniel Kroening, Edmund M. Clarke
SPAA
2003
ACM
14 years 19 days ago
Relaxing the problem-size bound for out-of-core columnsort
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
Geeta Chaudhry, Elizabeth A. Hamon, Thomas H. Corm...
MOBICOM
2004
ACM
14 years 24 days ago
Denial of service resilience in ad hoc networks
Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc ne...
Imad Aad, Jean-Pierre Hubaux, Edward W. Knightly