Sciweavers

1099 search results - page 151 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
ECCC
2011
205views ECommerce» more  ECCC 2011»
14 years 5 months ago
Graphs of Bounded Treewidth can be Canonized in AC1
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
Fabian Wagner
EGH
2011
Springer
13 years 10 months ago
Simpler and Faster HLBVH with Work Queues
A recently developed algorithm called Hierachical Linear Bounding Volume Hierarchies (HLBVH) has demonstrated the feasibility of reconstructing the spatial index needed for ray tr...
Kirill Garanzha, Jacopo Pantaleoni, David K. McAll...
MICCAI
2003
Springer
15 years 11 months ago
Mesh Topology Identification for Mass-Spring Models
In surgical simulations, the two most popular approaches to model soft tissues are Finite Element Method (FEM) and Mass-Spring System (MSS). Main advantages of FEM are accuracy and...
Gábor Székely, Gérald Bianchi...
RECOMB
2007
Springer
15 years 10 months ago
Support Vector Training of Protein Alignment Models
Abstract. Sequence to structure alignment is an important step in homology modeling of protein structures. Incorporation of features like secondary structure, solvent accessibility...
Chun-Nam John Yu, Thorsten Joachims, Ron Elber, Ja...
RECOMB
2005
Springer
15 years 10 months ago
Comparison of Protein-Protein Interaction Confidence Assignment Schemes
Recent technological advances have enabled high-throughput measurements of protein-protein interactions in the cell, producing protein interaction networks for various species at a...
Silpa Suthram, Tomer Shlomi, Eytan Ruppin, Roded S...