Sciweavers

130 search results - page 21 / 26
» Modeling distances in large-scale networks by matrix factori...
Sort
View
COMCOM
2008
95views more  COMCOM 2008»
13 years 7 months ago
CHESS: An application-aware space for enhanced scalable services in overlay networks
Abstract-- We introduce in this paper CHESS, an applicationaware space for enhanced scalable services in overlay networks. In this new space, the proximity of peers is determined a...
Mohammad Malli, Chadi Barakat, Walid Dabbous
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 4 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...
TIP
2010
153views more  TIP 2010»
13 years 5 months ago
A Versatile Model for Packet Loss Visibility and its Application to Packet Prioritization
In this paper, we propose a generalized linear model for video packet loss visibility that is applicable to different group-of-picture structures. We develop the model using three...
Ting-Lan Lin, Sandeep Kanumuri, Yuan Zhi, David Po...
ECIR
2011
Springer
12 years 11 months ago
A User-Oriented Model for Expert Finding
Expert finding addresses the problem of retrieving a ranked list of people who are knowledgeable on a given topic. Several models have been proposed to solve this task, but so far...
Elena Smirnova, Krisztian Balog
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...