Sciweavers

776 search results - page 84 / 156
» Distributed Information Regularization on Graphs
Sort
View
PODC
2012
ACM
13 years 5 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
15 years 4 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
GLOBECOM
2007
IEEE
15 years 9 months ago
On the (in)Effectiveness of Probabilistic Marking for IP Traceback Under DDoS Attacks
—Distributed denial-of-service attacks (DDoS) pose an immense threat to the Internet. The most studied solution is to let routers probabilistically mark packets with partial path...
Vamsi Paruchuri, Arjan Durresi, Raj Jain
137
Voted
RECSYS
2009
ACM
15 years 7 months ago
A semantic framework for personalized ad recommendation based on advanced textual analysis
In this paper we present a hybrid recommendation system that combines ontological knowledge with content-extracted linguistic information, derived from pre-trained lexical graphs,...
Dorothea Tsatsou, Fotis Menemenis, Ioannis Kompats...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 9 months ago
Identifying graphs from noisy and incomplete data
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
Galileo Mark S. Namata Jr., Lise Getoor