Sciweavers

391 search results - page 71 / 79
» Understanding information related fields: A conceptual frame...
Sort
View
BMCBI
2008
114views more  BMCBI 2008»
15 years 1 months ago
Partial mixture model for tight clustering of gene expression time-course
Background: Tight clustering arose recently from a desire to obtain tighter and potentially more informative clusters in gene expression studies. Scattered genes with relatively l...
Yinyin Yuan, Chang-Tsun Li, Roland Wilson
ASUNAM
2011
IEEE
14 years 1 months ago
Evolutionary Clustering and Analysis of Bibliographic Networks
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
Manish Gupta, Charu C. Aggarwal, Jiawei Han, Yizho...
TIT
2008
164views more  TIT 2008»
15 years 1 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
ICFCA
2007
Springer
15 years 7 months ago
A Parameterized Algorithm for Exploring Concept Lattices
Kuznetsov shows that Formal Concept Analysis (FCA) is a natural framework for learning from positive and negative examples. Indeed, the results of learning from positive examples (...
Peggy Cellier, Sébastien Ferré, Oliv...
FCCM
1999
IEEE
210views VLSI» more  FCCM 1999»
15 years 5 months ago
Algorithm Analysis and Mapping Environment for Adaptive Computing Systems: Further Results
Abstract We are developing an integrated algorithm analysis and mapping environment particularly tailored for signal processing applications on Adaptive Computing Systems ACS. Our ...
Eric K. Pauer, Paul D. Fiore, John M. Smith