Sciweavers

197 search results - page 39 / 40
» On the Existence of Large Sets of t-designs of Prime Sizes
Sort
View
CIKM
2008
Springer
13 years 7 months ago
Scalable community discovery on textual data with relations
Every piece of textual data is generated as a method to convey its authors' opinion regarding specific topics. Authors deliberately organize their writings and create links, ...
Huajing Li, Zaiqing Nie, Wang-Chien Lee, C. Lee Gi...
ENTCS
2008
103views more  ENTCS 2008»
13 years 5 months ago
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
Stefan Blom, Boudewijn R. Haverkort, Matthias Kunt...
DATAMINE
2006
89views more  DATAMINE 2006»
13 years 5 months ago
Scalable Clustering Algorithms with Balancing Constraints
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
Arindam Banerjee, Joydeep Ghosh
BMCBI
2007
120views more  BMCBI 2007»
13 years 5 months ago
Non-coding sequence retrieval system for comparative genomic analysis of gene regulatory elements
Background: Completion of the human genome sequence along with other species allows for greater understanding of the biochemical mechanisms and processes that govern healthy as we...
Sung Tae Doh, Yunyu Zhang, Matthew H. Temple, Li C...
JCST
2008
119views more  JCST 2008»
13 years 5 months ago
Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
Daniel Kunkle, Donghui Zhang, Gene Cooperman