Sciweavers

37 search results - page 5 / 8
» Competition against peer-to-peer networks
Sort
View
ALT
2009
Springer
14 years 4 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
MOBIDE
2010
ACM
13 years 7 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
PDP
2005
IEEE
14 years 1 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
AAAI
1996
13 years 9 months ago
Building Classifiers Using Bayesian Networks
Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competit...
Nir Friedman, Moisés Goldszmidt
ISPASS
2008
IEEE
14 years 2 months ago
Explaining the Impact of Network Transport Protocols on SIP Proxy Performance
This paper characterizes the impact that the use of UDP versus TCP has on the performance and scalability of the OpenSER SIP proxy server. The Session Initiation Protocol (SIP) is...
Kaushik Kumar Ram, Ian C. Fedeli, Alan L. Cox, Sco...