Sciweavers

2254 search results - page 144 / 451
» Computing the minimal covering set
Sort
View
BMCBI
2005
79views more  BMCBI 2005»
15 years 6 months ago
Mathematical design of prokaryotic clone-based microarrays
Background: Clone-based microarrays, on which each spot represents a random genomic fragment, are a good alternative to open reading frame-based microarrays, especially for microo...
Bart Pieterse, Elisabeth J. Quirijns, Frank H. J. ...
DAC
1997
ACM
15 years 10 months ago
A Graph-Based Synthesis Algorithm for AND/XOR Networks
In this paper, we introduce a Shared Multiple Rooted XORbased Decomposition Diagram XORDD to represent functions with multiple outputs. Based on the XORDD representation, we dev...
Yibin Ye, Kaushik Roy
IPPS
2009
IEEE
16 years 1 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
16 years 1 months ago
Latent Dirichlet Allocation and Singular Value Decomposition Based Multi-document Summarization
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
Rachit Arora, Balaraman Ravindran
ESWS
2007
Springer
16 years 22 days ago
Scalable Web Service Composition with Partial Matches
We investigate scalable algorithms for automated composition (WSC) of Semantic Web Services. Our notion of WSC is very general: the composition semantics includes background knowl...
Adina Sirbu, Jörg Hoffmann