Sciweavers

1171 search results - page 99 / 235
» Multisource Algorithmic Information Theory
Sort
View
WWW
2005
ACM
15 years 10 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
WWW
2003
ACM
15 years 10 months ago
A new paradigm for ranking pages on the world wide web
This paper describes a new paradigm for modeling traffic levels on the world wide web (WWW) using a method of entropy maximization. This traffic is subject to the conservation con...
John A. Tomlin
KDD
2004
ACM
127views Data Mining» more  KDD 2004»
15 years 10 months ago
A generative probabilistic approach to visualizing sets of symbolic sequences
There is a notable interest in extending probabilistic generative modeling principles to accommodate for more complex structured data types. In this paper we develop a generative ...
Peter Tiño, Ata Kabán, Yi Sun
CHI
2010
ACM
15 years 4 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
CISS
2008
IEEE
15 years 4 months ago
Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view
— As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due...
Junshan Zhang