Sciweavers

814 search results - page 106 / 163
» Optimal pairings
Sort
View
MOC
2011
13 years 4 months ago
A two-level enriched finite element method for a mixed problem
The simplest pair of spaces P1/P0 is made inf-sup stable for the mixed form of the Darcy equation. The key ingredient is enhance the finite element spaces inside a PetrovGalerkin ...
Alejandro Allendes, Gabriel R. Barrenechea, Erwin ...
ICALP
2011
Springer
13 years 1 months ago
Compact Navigation and Distance Oracles for Graphs with Small Treewidth
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
Arash Farzan, Shahin Kamali
COMBINATORICA
2011
12 years 9 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
CVPR
2012
IEEE
12 years 11 days ago
Random walks based multi-image segmentation: Quasiconvexity results and GPU-based solutions
We recast the Cosegmentation problem using Random Walker (RW) segmentation as the core segmentation algorithm, rather than the traditional MRF approach adopted in the literature s...
Maxwell D. Collins, Jia Xu, Leo Grady, Vikas Singh
BMCBI
2008
109views more  BMCBI 2008»
13 years 10 months ago
ConStruct: Improved construction of RNA consensus structures
Background: Aligning homologous non-coding RNAs (ncRNAs) correctly in terms of sequence and structure is an unresolved problem, due to both mathematical complexity and imperfect s...
Andreas Wilm, Kornelia Linnenbrink, Gerhard Steger