Sciweavers

464 search results - page 51 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
INFOCOM
2007
IEEE
15 years 6 months 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
ICDE
2007
IEEE
136views Database» more  ICDE 2007»
16 years 1 months ago
Norm, Point, and Distance Estimation Over Multiple Signals Using Max-Stable Distributions
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...
Stilian Stoev, Marios Hadjieleftheriou, George Kol...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 7 days ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
VMV
2007
155views Visualization» more  VMV 2007»
15 years 1 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 5 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky