Sciweavers

1383 search results - page 274 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
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
TON
2010
197views more  TON 2010»
14 years 8 months ago
Constrained relay node placement in wireless sensor networks: formulation and approximations
—One approach to prolong the lifetime of a wireless sensor network (WSN) is to deploy some relay nodes to communicate with the sensor nodes, other relay nodes, and the base stati...
Satyajayant Misra, Seung Don Hong, Guoliang Xue, J...
ICAI
2010
14 years 8 months ago
Exact Loopy Belief Propagation on Euler Graphs
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
Chen-Hsiang Yeang
ICCAD
2010
IEEE
125views Hardware» more  ICCAD 2010»
14 years 8 months ago
Peak current reduction by simultaneous state replication and re-encoding
Reducing circuit's peak current plays an important role in circuit reliability in deep sub-micron era. For sequential circuits, it is observed that the peak current has a str...
Junjun Gu, Gang Qu, Lin Yuan, Qiang Zhou
WWW
2011
ACM
14 years 4 months ago
Limiting the spread of misinformation in social networks
In this work, we study the notion of competing campaigns in a social network. By modeling the spread of influence in the presence of competing campaigns, we provide necessary too...
Ceren Budak, Divyakant Agrawal, Amr El Abbadi