Sciweavers

1871 search results - page 57 / 375
» The Ephemeral Pairing Problem
Sort
View
157
Voted
ISMB
1997
15 years 8 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
ALMOB
2006
97views more  ALMOB 2006»
15 years 6 months ago
The approximability of the String Barcoding problem
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...
Giuseppe Lancia, Romeo Rizzi
MOC
2011
15 years 1 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 ...
EJWCN
2010
122views more  EJWCN 2010»
15 years 1 months ago
Using Model Checking for Analyzing Distributed Power Control Problems
Model checking (MC) is a formal verification technique which has known and still knows a resounding success in the computer science community. Realizing that the distributed power...
Thomas Brihaye, Marc Jungers, Samson Lasaulce, Nic...
DATE
2008
IEEE
111views Hardware» more  DATE 2008»
16 years 1 months ago
A Formal Approach To The Protocol Converter Problem
In the absence of a single module interface standard, integration of pre-designed modules in System-on-Chip design often requires the use of protocol converters. Existing approach...
Karin Avnit, Vijay D'Silva, Arcot Sowmya, S. Rames...