Sciweavers

1434 search results - page 185 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
ICML
2009
IEEE
16 years 3 months ago
Unsupervised hierarchical modeling of locomotion styles
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...
Wei Pan, Lorenzo Torresani
PERCOM
2006
ACM
16 years 1 months ago
Node Clustering in Mobile Peer-to-Peer Multihop Networks
In mobile peer-to-peer (MP2P) networks, nodes tend to gather together rather than scattered uniformly across the network area. This paper considers the clustering of peer nodes an...
Chansu Yu, Kang G. Shin, Ben Lee, Seung-Min Park, ...
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 8 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
114
Voted
ATAL
2007
Springer
15 years 8 months ago
An incentive mechanism for message relaying in unstructured peer-to-peer systems
Distributed message relaying is an important function of a peer-topeer system to discover service providers. Existing search protocols in unstructured peer-to-peer systems either ...
Cuihong Li, Bin Yu, Katia P. Sycara
IWCMC
2006
ACM
15 years 8 months ago
VANETCODE: network coding to enhance cooperative downloading in vehicular ad-hoc networks
Inter-vehicular communication is fast emerging as a popular application for mobile ad-hoc networks. Content distribution in Vehicular Ad-Hoc Networks (VANET) is particularly chall...
Shabbir Ahmed, Salil S. Kanhere