1871 search results - page 165 / 375 » The Ephemeral Pairing Problem |
181
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
192
Voted
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
171
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
In this paper we analyze the complexity of scheduling wireless links in the physical interference model with analog network coding capability. We study two models with different d...
161
click to vote
SOFSEM
2010
Springer
16 years 3 months ago
2010
Springer
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
178
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of computing zigzag persistence of a sequence of homology groups and study a particular sequence derived from the levelsets of a real-valued function on a top...