16504 search results - page 192 / 3301 » New Problems, New Solutions |
161
click to vote
DAM
2010
15 years 6 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
195
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
179
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
168
click to vote
ICIP
2008
IEEE
16 years 29 days ago
2008
IEEE
In several imaging inverse problems, it may be of interest to encourage the solution to have characteristics which are most naturally expressed by the combination of more than one...
174
click to vote
AIPS
2007
15 years 8 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...