Sciweavers

387 search results - page 30 / 78
» Mining Approximative Descriptions of Sets Using Rough Sets
Sort
View
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...
HIPC
1999
Springer
13 years 12 months ago
High Performance Data Mining
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
Vipin Kumar, Jaideep Srivastava
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
13 years 11 months ago
Epsilon-constraint with an efficient cultured differential evolution
In this paper we present the use of a previously developed single-objective optimization approach, together with the -constraint method, to provide an approximation of the Pareto ...
Ricardo Landa Becerra, Carlos A. Coello Coello
COMPGEOM
2003
ACM
14 years 27 days ago
Curve-sensitive cuttings
We introduce (1/r)-cuttings for collections of surfaces in 3-space that are sensitive to an additional collection of curves. Specifically, let S be a set of n surfaces in R3 of c...
Vladlen Koltun, Micha Sharir
WILF
2005
Springer
112views Fuzzy Logic» more  WILF 2005»
14 years 1 months ago
NEC for Gene Expression Analysis
Aim of this work is to apply a novel comprehensive machine learning tool for data mining to preprocessing and interpretation of gene expression data. Furthermore, some visualizatio...
Roberto Amato, Angelo Ciaramella, N. Deniskina, Ca...