693 search results - page 29 / 139 » Minimization and Partitioning Method Reducing Input Sets |
107
click to vote
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
489
click to vote
Presentation
In this paper, we propose a decentralized method for maximizing lifetime of data collection wireless sensor networks (WSNs) by making minimal number of nodes operate and putting ot...
102
click to vote
PG
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
108
click to vote
RSFDGRC
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
126
click to vote
TPDS
1998
15 years 1 months ago
1998
—Increasingly larger data sets are being stored in networked architectures. Many of the available data structures are not easily amenable to parallel realizations. Hashing scheme...