1285 search results - page 102 / 257 » On the Complexity of Ordinal Clustering |
ICALP
2011
Springer
13 years 1 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
WWW
2003
ACM
14 years 10 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
HPCA
2003
IEEE
14 years 10 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
PERCOM
2008
ACM
14 years 9 months ago
2008
ACM
The IEEE 802.15.4 standard defines a set of procedures to set-up a Low-Rate Wireless Personal Area Network where nodes self-organize into a logical communication structure through ...
ACISICIS
2007
IEEE
14 years 4 months ago
2007
IEEE
We present here some applications of the Minimum Message Length (MML) principle to spatially correlated data. Discrete valued Markov Random Fields are used to model spatial correl...