Sciweavers

1603 search results - page 304 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
15 years 10 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
RECOMB
1997
Springer
15 years 2 months ago
On the complexity and approximation of syntenic distance
The paper studies the computational complexity and approximation algorithms for a new evolutionary distance between multi-chromosomal genomes introduced recently by Ferretti, Nade...
Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming ...
BMCBI
2005
121views more  BMCBI 2005»
14 years 9 months ago
Evaluation of gene importance in microarray data based upon probability of selection
Background: Microarray devices permit a genome-scale evaluation of gene function. This technology has catalyzed biomedical research and development in recent years. As many import...
Li M. Fu, Casey S. Fu-Liu
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 4 months ago
Soft memory for stock market analysis using linear and developmental genetic programming
Recently, a form of memory usage was introduced for genetic programming (GP) called “soft memory.” Rather than have a new value completely overwrite the old value in a registe...
Garnett Carl Wilson, Wolfgang Banzhaf
MFCS
2000
Springer
15 years 1 months ago
On the Use of Duality and Geometry in Layouts for ATM Networks
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
Shmuel Zaks