Sciweavers

15351 search results - page 198 / 3071
» The information bottleneck method
Sort
View
DEXAW
1999
IEEE
102views Database» more  DEXAW 1999»
14 years 1 months ago
NIGELOG: Protecting Logging Information by Hiding Multiple Backups in Directories
This paper proposed a novel method to protect logging information more securely. The method, named NIGELOG, produces multiple backups of the logging information, hides them in arb...
Tetsuji Takada, Hideki Koike
ICANN
2010
Springer
13 years 10 months ago
On Estimating Mutual Information for Feature Selection
Abstract. Mutual Information (MI) is a powerful concept from information theory used in many application fields. For practical tasks it is often necessary to estimate the Mutual In...
Erik Schaffernicht, Robert Kaltenhaeuser, Saurabh ...
ENTCS
2008
102views more  ENTCS 2008»
13 years 9 months ago
A Monotonicity Principle for Information Theory
We establish a monotonicity principle for convex functions that enables high-level reasoning about capacity in information theory. Despite its simplicity, this single idea is rema...
Konstantinos Chatzikokolakis, Keye Martin
EDBT
2004
ACM
192views Database» more  EDBT 2004»
14 years 9 months ago
LIMBO: Scalable Clustering of Categorical Data
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
Periklis Andritsos, Panayiotis Tsaparas, Ren&eacut...
LATIN
2010
Springer
14 years 3 months ago
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization
Topological self-stabilization is an important concept to build robust open distributed systems (such as peer-to-peer systems) where nodes can organize themselves into meaningful n...
Dominik Gall, Riko Jacob, Andréa W. Richa, ...