Results 1  10
of
228,961
Feature selection based on mutual information: Criteria of maxdependency, maxrelevance, and minredundancy
 IEEE TRANS. PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2005
"... Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion based on mutual information. Because of the difficulty in directly implementing the maximal dependency condition, we first der ..."
Abstract

Cited by 571 (8 self)
 Add to MetaCart
derive an equivalent form, called minimalredundancymaximalrelevance criterion (mRMR), for firstorder incremental feature selection. Then, we present a twostage feature selection algorithm by combining mRMR and other more sophisticated feature selectors (e.g., wrappers). This allows us to select a
LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME
 SIAM J. COMPUT.
, 2001
"... A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log U), a static dictionary for nelement sets with constant worst case query time can be obtained using B +O(log log U)+o(n) (U) bits ..."
Abstract

Cited by 61 (9 self)
 Add to MetaCart
A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log U), a static dictionary for nelement sets with constant worst case query time can be obtained using B +O(log log U)+o(n) (U) bits of storage, where B = ⌈log2 ⌉ is the minimum number of bits needed to represent all nn element subsets of U.
directional, shiftinsensitive, lowredundancy, wavelet transform
 in IEEE Proceedings: ICIP
, 2001
"... Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, nonseparable wavelet transforms or by using restrictive designs to obtain a pair of wavelet trees with a transformdomain r ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
density wavelet transform so as to separate approximately the positive and negative frequencies, thereby increasing directionality. Subsequent decimation and a novel inverse projection maintain the low redundancy while ensuring perfect reconstruction. Although our transform generates complexvalued coefficients
EndToEnd Arguments In System Design
, 1984
"... This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the endtoend argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost o ..."
Abstract

Cited by 1037 (10 self)
 Add to MetaCart
This paper presents a design principle that helps guide placement of functions among the modules of a distributed computer system. The principle, called the endtoend argument, suggests that functions placed at low levels of a system may be redundant or of little value when compared with the cost
LOW REDUNDANCY IN STATIC DICTIONARIES WITH CONSTANT QUERY TIME∗
"... Abstract. A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log U ), a static dictionary for nelement sets with constant worst case query time can be obtained using B+O(log log U )+o(n) ..."
Abstract
 Add to MetaCart
Abstract. A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size Θ(log U ), a static dictionary for nelement sets with constant worst case query time can be obtained using B+O(log log U )+o(n) bits of storage, where B = log2 (U n) is the minimum number of bits needed to represent all nelement subsets of U.
LowRedundancy TwoDimensional RAID Arrays
"... Abstract—Most extant twodimensional RAID arrays tend to use a square matrix organization such that each row and each column of the array forms a parity stripe. These arrays require 2k parity disks to protect the contents of k 2 data disks against all double disk failures and most triple disk failur ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract—Most extant twodimensional RAID arrays tend to use a square matrix organization such that each row and each column of the array forms a parity stripe. These arrays require 2k parity disks to protect the contents of k 2 data disks against all double disk failures and most triple disk failures. We investigate the reliability of a lesser known organization that allows k parity disks to protect k(k – 1)/2 data disks against all double and most triple failures. We found that this organization can provide the same or better mean times to data loss (MTTDLs) than organizations requiring more parity disks to protect the same number of data disks. Keywordsarchival storage systems; RAID arrays I.
A New Directional, LowRedundancy, ComplexWavelet Transform
"... Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, nonseparable wavelet transforms or by using restrictive designs to obtain a pair of wavelet trees with a transformdomain r ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
density wavelet transform so as to separate approximately the positive and negative frequencies, thereby increasing directionality. Subsequent decimation and a novel inverse projection maintain the low redundancy while ensuring perfect reconstruction. Although our transform generates complexvalued coefficients
ASCENT: Adaptive selfconfiguring sensor networks topologies
, 2004
"... Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks w ..."
Abstract

Cited by 449 (15 self)
 Add to MetaCart
Advances in microsensor and radio technology will enable small but smart sensors to be deployed for a wide range of environmental monitoring applications. The low pernode cost will allow these wireless networks of sensors and actuators to be densely distributed. The nodes in these dense networks
Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time
 IN PROCEEDINGS OF THE 26TH INTERNATIONAL COLLOQUIUM ON AUTOMATA, LANGUAGES AND PROGRAMMING (ICALP '99
, 1999
"... A static dictionary is a data structure for storing subsets of a nite universe U , so that membership queries can be answered efficiently. We study this problem in a unit cost RAM model with word size (log jU j), and show that for nelement subsets, constant worst case query time can be obtained us ..."
Abstract

Cited by 27 (6 self)
 Add to MetaCart
A static dictionary is a data structure for storing subsets of a nite universe U , so that membership queries can be answered efficiently. We study this problem in a unit cost RAM model with word size (log jU j), and show that for nelement subsets, constant worst case query time can be obtained using B +O(log log jU j) + o(n) bits of storage, where B = dlog 2 jUj n e is the minimum number of bits needed to represent all such subsets. For jU j = n log O(1) n the dictionary supports constant time rank queries.
Results 1  10
of
228,961