Sciweavers

927 search results - page 10 / 186
» A comparison of two approaches to pseudorandomness
Sort
View
ICWE
2004
Springer
15 years 2 months ago
Representing XML Schema in UML - A Comparison of Approaches
Abstract. There is a need to integrate XML schemas, i.e., schemas written in XML Schema, into UML-based software development processes. Not only the production of XML schemas out o...
Martin Bernauer, Gerti Kappel, Gerhard Kramler
IPPS
1997
IEEE
15 years 1 months ago
A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis
Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to spee...
Sumit Roy, Prithviraj Banerjee
SIGIR
2009
ACM
15 years 3 months ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin
BMCBI
2007
164views more  BMCBI 2007»
14 years 9 months ago
Comparison of probabilistic Boolean network and dynamic Bayesian network approaches for inferring gene regulatory networks
Background: The regulation of gene expression is achieved through gene regulatory networks (GRNs) in which collections of genes interact with one another and other substances in a...
Peng Li, Chaoyang Zhang, Edward J. Perkins, Ping G...
ACL
2012
12 years 11 months ago
A Comparison of Chinese Parsers for Stanford Dependencies
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Wanxiang Che, Valentin I. Spitkovsky, Ting Liu