Sciweavers

1259 search results - page 38 / 252
» Knowledge and Structure in Social Algorithms
Sort
View
WWW
2008
ACM
14 years 9 months ago
Finding similar pages in a social tagging repository
Social tagging describes a community of users labeling web content with tags. It is a simple activity that enriches our knowledge about resources on the web. For a computer to hel...
Alex Penev, Raymond K. Wong
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 9 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
FLAIRS
2006
13 years 10 months ago
Model Construction Algorithms for Object-Oriented Probabilistic Relational Models
This paper presents three new algorithms for the automatic construction of models from Object Oriented Probabilistic RelationalModels. The first two algorithms are based on the kn...
Catherine Howard, Markus Stumptner
CADE
2006
Springer
14 years 9 months ago
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
We describe here a formal proof in the Coq system of the structure theorem for subresultants, which allows to prove formally the correctness of our implementation of the subresulta...
Assia Mahboubi
AIIA
2007
Springer
14 years 2 months ago
Structured Hidden Markov Model: A General Framework for Modeling Complex Sequences
Structured Hidden Markov Model (S-HMM) is a variant of Hierarchical Hidden Markov Model that shows interesting capabilities of extracting knowledge from symbolic sequences. In fact...
Ugo Galassi, Attilio Giordana, Lorenza Saitta