Sciweavers

3096 search results - page 497 / 620
» Theory and Use of the EM Algorithm
Sort
View
KDD
2012
ACM
217views Data Mining» more  KDD 2012»
11 years 11 months ago
The long and the short of it: summarising event sequences with serial episodes
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
Nikolaj Tatti, Jilles Vreeken
WWW
2008
ACM
14 years 9 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
POPL
2007
ACM
14 years 9 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
14 years 3 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
P2P
2008
IEEE
102views Communications» more  P2P 2008»
14 years 3 months ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....