Sciweavers

391 search results - page 43 / 79
» Sortabilities of Partition Properties
Sort
View
KIVS
2009
Springer
15 years 7 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
96
Voted
HT
2009
ACM
15 years 7 months ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
76
Voted
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 7 months ago
Anti-monotonic Overlap-Graph Support Measures
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
Toon Calders, Jan Ramon, Dries Van Dyck
124
Voted
ISVD
2007
IEEE
15 years 7 months ago
Voronoi Diagram with Respect to Criteria on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...
102
Voted
IDA
2007
Springer
15 years 7 months ago
Compact and Understandable Descriptions of Mixtures of Bernoulli Distributions
Abstract. Finite mixture models can be used in estimating complex, unknown probability distributions and also in clustering data. The parameters of the models form a complex repres...
Jaakko Hollmén, Jarkko Tikka