1356 search results - page 49 / 272 » Some New Results on Inverse Sorting Problems |
PRL
2002
13 years 9 months ago
2002
As a new pattern classification method, nearest feature line (NFL) provides an effective way to tackle the sort of pattern recognition problems where only limited data are availab...
CIBCB
2005
IEEE
14 years 2 months ago
2005
IEEE
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...
NIPS
2003
13 years 10 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
ALGORITHMICA
2010
13 years 9 months ago
2010
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...