Sciweavers

315 search results - page 36 / 63
» A General Small Cancellation Theory
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
CIKM
2009
Springer
14 years 2 months ago
Compressing tags to find interesting media groups
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Solving the MAXSAT problem using a multivariate EDA based on Markov networks
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
Alexander E. I. Brownlee, John A. W. McCall, Deryc...
IWCMC
2006
ACM
14 years 1 months ago
Distributed obstacle localization in large wireless sensor networks
Obstacles are but pleasing for many aspects of large realworld sensor networks. Among other things, the presence of obstacles distort the sensor node localization process and migh...
Frank Reichenbach, Ralf Salomon, Dirk Timmermann
SIGIR
2006
ACM
14 years 1 months ago
Minimal test collections for retrieval evaluation
Accurate estimation of information retrieval evaluation metrics such as average precision require large sets of relevance judgments. Building sets large enough for evaluation of r...
Ben Carterette, James Allan, Ramesh K. Sitaraman