Sciweavers

8499 search results - page 1578 / 1700
» network 2007
Sort
View
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
14 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
WEA
2007
Springer
138views Algorithms» more  WEA 2007»
14 years 3 months ago
Dynamic Highway-Node Routing
We introduce a dynamic technique for fast route planning in large road networks. For the first time, it is possible to handle the practically relevant scenarios that arise in pres...
Dominik Schultes, Peter Sanders
WEBI
2007
Springer
14 years 3 months ago
PSSF: A Novel Statistical Approach for Personalized Service-side Spam Filtering
The volume of spam e-mails has grown rapidly in the last two years resulting in increasing costs to users, network operators, and e-mail service providers (ESPs). E-mail users dem...
Khurum Nazir Junejo, Asim Karim
WEBI
2007
Springer
14 years 3 months ago
Flickr: Who is Looking?
This article presents a characterization of user behavior on Flickr, a popular on-line photo sharing service that allows users to store, search, sort and share their photos. Based...
Roelof van Zwol
AAIM
2007
Springer
120views Algorithms» more  AAIM 2007»
14 years 1 months ago
Online OVSF Code Assignment with Resource Augmentation
Abstract. Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division MultipleAccess (W-CDMA) systems, which play an important ro...
Francis Y. L. Chin, Yong Zhang, Hong Zhu
« Prev « First page 1578 / 1700 Last » Next »