Sciweavers

712 search results - page 113 / 143
» A mixture model for random graphs
Sort
View
SODA
2010
ACM
179views Algorithms» more  SODA 2010»
14 years 5 months ago
Property Testing and Parameter Testing for Permutations
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
Carlos Hoppen, Yoshiharu Kohayakawa, Carlos G. T. ...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Fractional Repetition Codes for Repair in Distributed Storage Systems
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
Salim Y. El Rouayheb, Kannan Ramchandran
TIT
2010
146views Education» more  TIT 2010»
13 years 2 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
MOBIHOC
2012
ACM
11 years 10 months ago
Spatial spectrum access game: nash equilibria and distributed learning
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...
Xu Chen, Jianwei Huang
CISS
2008
IEEE
14 years 2 months ago
A lower-bound on the number of rankings required in recommender systems using collaborativ filtering
— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
Peter Marbach