نتایج جستجو برای Bottleneck

تعداد نتایج: 12748  

Journal: :J. Inf. Sci. Eng. 2002
William Chung-Kung Yen,

In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with n-vertex-set V and m-edge-set E, where each vertex v is associated with a real cost W(v). Given any subset V′ of V, the bottleneck cost of V′ is defined as max{W(x)  x ∈ V′}. The major task involves identifying a dom...

2010
Pu Wang, Carlotta Domeniconi, Kathryn Blackmond Laskey,

Co-clustering has emerged as an important approach for mining contingency data matrices. We present a novel approach to co-clustering based on the Information Bottleneck principle, called Information Bottleneck Co-clustering (IBCC), which supports both soft-partition and hardpartition co-clusterings, and leverages an annealing-style strategy to bypass local optima. Existing co-clustering method...

2011

The first positive trend is the slowing of global population growth. There is a significant shift in global fertility that will enable us at least to think about moving to a world of near stable populations within a century, maybe sooner. Fertility in about 40 per cent of the world’s countries is now below the replacement rate. Another 40 per cent are experiencing continued downward movement of...

Journal: :CoRR 2010
Pavel Yu. Chebotarev,

A matrix S = (sij) ∈ R n×n is said to determine a transitional measure for a digraph Γ on n vertices if for all i, j, k ∈ {1, . . . , n}, the transition inequality sij sjk ≤ sik sjj holds and reduces to the equality (called the graph bottleneck identity) if and only if every path in Γ from i to k contains j. We show that every positive transitional measure produces a distance by means of a loga...

2006
Saral Mukherjee, A. K. Chatterjee,

The term ‘bottleneck’ has been extensively used in operations management literature. Management paradigms like the Theory of Constraints focus on the identification and exploitation of bottlenecks. Yet, we show that the term has not been rigorously defined. We provide a classification of bottleneck definitions available in literature and discuss several myths associated with the concept of bott...

1995
Russ Blake, John S. Breese,

We describe the diagnosis and treatment of bottlenecks in computer systems using decison theoretic techniques. The techniques rely on a high-level functional model of the interaction between application workloads, the operating system (Windows NT), and system hardware. Given a workload description, the model predicts the values of system counters observable with the Windows NT performance monit...

2003
David Gondek, Thomas Hofmann,

We present an extension of the well-known information bottleneck framework, called conditional information bottleneck, which takes negative relevance information into account by maximizing a conditional mutual information score. This general approach can be utilized in a data mining context to extract relevant information that is at the same time novel relative to known properties or structures...

2018
Ryo Kawasaki, Hideo Konishi, Junki Yukawa,

This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension of congestion games by Milchtaich (1996). After characterizing Nash equilibrium of the game, we provide sufficient conditions for which the equivalence between Nash and strong equilibria holds. Somewhat surprisingly, unlike in congestion games, a Nash equilibrium in pure strategies may...

Journal: :CoRR 1999
Naftali Tishby, Fernando Pereira, William Bialek,

We define the relevant information in a signal x ∈ X as being the information that this signal provides about another signal y ∈ Y . Examples include the information that face images provide about the names of the people portrayed, or the information that speech sounds provide about the words spoken. Understanding the signal x requires more than just predicting y, it also requires specifying wh...

Journal: :Neural computation 2001
Nir Friedman, Ori Mosenzon, Noam Slonim, Naftali Tishby,

The information bottleneck (IB) method is an unsupervised model independent data organization technique. Given a joint distribution, p(X, Y), this method constructs a new variable, T, that extracts partitions, or clusters, over the values of X that are informative about Y. Algorithms that are motivated by the IB method have already been applied to text classification, gene expression, neural co...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید