Sciweavers

672 search results - page 111 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
PODC
2005
ACM
14 years 2 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SIGECOM
2011
ACM
311views ECommerce» more  SIGECOM 2011»
12 years 11 months ago
The role of social networks in online shopping: information passing, price of trust, and consumer choice
While social interactions are critical to understanding consumer behavior, the relationship between social and commerce networks has not been explored on a large scale. We analyze...
Stephen Guo, Mengqiu Wang, Jure Leskovec
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
14 years 3 months ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
ICML
2004
IEEE
14 years 9 months ago
Learning associative Markov networks
Markov networks are extensively used to model complex sequential, spatial, and relational interactions in fields as diverse as image processing, natural language analysis, and bio...
Benjamin Taskar, Vassil Chatalbashev, Daphne Kolle...
IPTPS
2004
Springer
14 years 2 months ago
Uncoordinated Load Balancing and Congestion Games in P2P Systems
In P2P systems, users often have many choices of peers from whom to download their data. Each user cares primarily about its own response time, which depends on how many other use...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou