Sciweavers

458 search results - page 5 / 92
» Fast and Simple Relational Processing of Uncertain Data
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
VMV
2008
164views Visualization» more  VMV 2008»
13 years 9 months ago
Vector Glyphs for Surfaces: A Fast and Simple Glyph Placement Algorithm for Adaptive Resolution Meshes
Visualization of flow on boundary surfaces from computational flow dynamics (CFD) is challenging due to the complex, adaptive resolution nature of the meshes used in the modeling ...
Zhenmin Peng, Robert S. Laramee
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
TDM
2004
203views Database» more  TDM 2004»
13 years 9 months ago
Relational Algebra: Mother Tongue - XQuery: Fluent
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
Torsten Grust, Jens Teubner
SIGMOD
2007
ACM
190views Database» more  SIGMOD 2007»
14 years 7 months ago
Map-reduce-merge: simplified relational data processing on large clusters
Map-Reduce is a programming model that enables easy development of scalable parallel applications to process vast amounts of data on large clusters of commodity machines. Through ...
Hung-chih Yang, Ali Dasdan, Ruey-Lung Hsiao, Dougl...