Sciweavers

375 search results - page 30 / 75
» An Algorithm to Find Overlapping Community Structure in Netw...
Sort
View
CIKM
2009
Springer
14 years 2 months ago
A mobile tourist assistance and recommendation system based on complex networks
In recent years, the tourism assistance community is gradually shifting its emphasis to digital, interactive systems. Our project aims for digital tourism assistance by combining ...
Alf-Christian Schering, Martin Dueffer, Andreas Fi...
WWW
2008
ACM
14 years 8 months ago
As we may perceive: finding the boundaries of compound documents on the web
This paper considers the problem of identifying on the Web compound documents (cDocs) ? groups of web pages that in aggregate constitute semantically coherent information entities...
Pavel Dmitriev
JMLR
2010
115views more  JMLR 2010»
13 years 2 months ago
Bayesian structure discovery in Bayesian networks with less space
Current exact algorithms for score-based structure discovery in Bayesian networks on n nodes run in time and space within a polynomial factor of 2n . For practical use, the space ...
Pekka Parviainen, Mikko Koivisto
METMBS
2004
151views Mathematics» more  METMBS 2004»
13 years 9 months ago
Machine Learning Techniques for the Evaluation of External Skeletal Fixation Structures
In this thesis we compare several machine learning techniques for evaluating external skeletal fixation proposals. We experimented in the context of dog bone fractures but the pot...
Ning Suo, Khaled Rasheed, Walter D. Potter, Dennis...
EPIA
2009
Springer
14 years 2 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...