Sciweavers

3096 search results - page 323 / 620
» The Generalized FITC Approximation
Sort
View
INFOCOM
2007
IEEE
16 years 27 days ago
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks
— The forthcoming 4G cellular systems will provide broadband wireless access to a variety of advanced data and voice services. In order to do that, these networks will have a sig...
David Amzallag, Joseph Naor, Danny Raz
PG
2007
IEEE
16 years 26 days ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
COLT
2007
Springer
16 years 23 days ago
A Lower Bound for Agnostically Learning Disjunctions
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
Adam R. Klivans, Alexander A. Sherstov
PKDD
2007
Springer
131views Data Mining» more  PKDD 2007»
16 years 21 days ago
Expectation Propagation for Rating Players in Sports Competitions
Abstract. Rating players in sports competitions based on game results is one example of paired comparison data analysis. Since an exact Bayesian treatment is intractable, several t...
Adriana Birlutiu, Tom Heskes
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 19 days ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan