Sciweavers

9572 search results - page 95 / 1915
» Cover Algorithms and Their Combination
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 12 months ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 6 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
SIGIR
2008
ACM
14 years 11 months ago
Latent dirichlet allocation based multi-document summarization
Extraction based Multi-Document Summarization Algorithms consist of choosing sentences from the documents using some weighting mechanism and combining them into a summary. In this...
Rachit Arora, Balaraman Ravindran
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
15 years 3 months ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
CN
2010
95views more  CN 2010»
14 years 12 months ago
Loop-free alternates and not-via addresses: A proper combination for IP fast reroute?
The IETF currently discusses fast reroute mechanisms for IP networks (IP FRR). IP FRR accelerates the recovery in case of network element failures and avoids micro-loops during re...
Michael Menth, Matthias Hartmann, Rüdiger Mar...