Sciweavers

2277 search results - page 372 / 456
» Clustering by pattern similarity in large data sets
Sort
View
KI
1999
Springer
15 years 10 months ago
Computing Probabilistic Least Common Subsumers in Description Logics
Computing least common subsumers in description logics is an important reasoning service useful for a number of applications. As shown in the literature, it can, for instance, be u...
Thomas Mantay, Ralf Möller, Alissa Kaplunova
UIST
1990
ACM
15 years 10 months ago
Glyphs: flyweight objects for user interfaces
Current user interface toolkits provide components that are complex and expensive. Programmers cannot use these components for many kinds of application data because the resulting...
Paul R. Calder, Mark A. Linton
ERCIM
2007
125views more  ERCIM 2007»
15 years 6 months ago
Workflow Management Systems for Grid Computing
With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute s...
Carmen Bratosin, Wil M. P. van der Aalst
RECOMB
2004
Springer
16 years 6 months ago
Computational identification of evolutionarily conserved exons
Phylogenetic hidden Markov models (phylo-HMMs) have recently been proposed as a means for addressing a multispecies version of the ab initio gene prediction problem. These models ...
Adam C. Siepel, David Haussler
BMCBI
2010
155views more  BMCBI 2010»
15 years 6 months ago
A flexible R package for nonnegative matrix factorization
Background: Nonnegative Matrix Factorization (NMF) is an unsupervised learning technique that has been applied successfully in several fields, including signal processing, face re...
Renaud Gaujoux, Cathal Seoighe