Sciweavers

1578 search results - page 311 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
APVIS
2009
13 years 9 months ago
Visibility-driven transfer functions
Direct volume rendering is an important tool for visualizing complex data sets. However, in the process of generating 2D images from 3D data, information is lost in the form of at...
Carlos D. Correa, Kwan-Liu Ma
BIRTHDAY
2010
Springer
13 years 9 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
FSTTCS
2008
Springer
13 years 9 months ago
Banach-Mazur Games on Graphs
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Erich Grädel
BMCBI
2007
131views more  BMCBI 2007»
13 years 8 months ago
FUNC: a package for detecting significant associations between gene sets and ontological annotations
Background: Genome-wide expression, sequence and association studies typically yield large sets of gene candidates, which must then be further analysed and interpreted. Informatio...
Kay Prüfer, Bjoern Muetzel, Hong Hai Do, Gunt...
BMCBI
2008
137views more  BMCBI 2008»
13 years 8 months ago
VennMaster: Area-proportional Euler diagrams for functional GO analysis of microarrays
Background: Microarray experiments generate vast amounts of data. The functional context of differentially expressed genes can be assessed by querying the Gene Ontology (GO) datab...
Hans A. Kestler, André Müller, Johann ...