Sciweavers

55 search results - page 9 / 11
» Hiding Satisfying Assignments: Two Are Better than One
Sort
View
INFOCOM
2010
IEEE
13 years 5 months ago
Opportunistic Routing in Multi-radio Multi-channel Multi-hop Wireless Networks
— Two major factors that limit the throughput in multi-hop wireless networks are the unreliability of wireless transmissions and co-channel interference. One promising technique ...
Kai Zeng, Zhenyu Yang, Wenjing Lou
MOBIHOC
2009
ACM
14 years 7 months ago
MotionCast: on the capacity and delay tradeoffs
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
Chenhui Hu, Xinbing Wang, Feng Wu
BMCBI
2005
114views more  BMCBI 2005»
13 years 6 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 7 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 1 days ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen