Sciweavers

130 search results - page 14 / 26
» Modeling distances in large-scale networks by matrix factori...
Sort
View
SODA
2010
ACM
215views Algorithms» more  SODA 2010»
14 years 4 months ago
Approximability of Robust Network Design
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
Neil Olver, F. Bruce Shepherd
IPSN
2007
Springer
14 years 1 months ago
Improving wireless simulation through noise modeling
We propose modeling environmental noise in order to efficiently and accurately simulate wireless packet delivery. We measure noise traces in many different environments and propo...
HyungJune Lee, Alberto Cerpa, Philip Levis
ICANN
2009
Springer
14 years 2 months ago
Basis Decomposition of Motion Trajectories Using Spatio-temporal NMF
Abstract. This paper’s intention is to present a new approach for decomposing motion trajectories. The proposed algorithm is based on nonnegative matrix factorization, which is a...
Sven Hellbach, Julian Eggert, Edgar Körner, H...
ICDE
2008
IEEE
139views Database» more  ICDE 2008»
14 years 9 months ago
Maintaining Connectivity in Dynamic Multimodal Network Models
Network data models are frequently used as a mechanism to describe the connectivity between spatial features in many emerging GIS applications (location-based services, transporta...
Petko Bakalov, Erik G. Hoel, Wee-Liang Heng, Vassi...
RECSYS
2010
ACM
13 years 7 months ago
Collaborative filtering via euclidean embedding
Recommendation systems suggest items based on user preferences. Collaborative filtering is a popular approach in which recommending is based on the rating history of the system. O...
Mohammad Khoshneshin, W. Nick Street