1871 search results - page 89 / 375 » The Ephemeral Pairing Problem |
COGSCI
2004
14 years 11 months ago
2004
It is easy to construct pairs of sentences X, Y that lead many people to ascribe higher probability to the conjunction X-and-Y than to the conjuncts X, Y. Whether an error is ther...
SIAMDM
2010
14 years 6 months ago
2010
Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among ...
ICCV
2001
IEEE
16 years 1 months ago
2001
IEEE
We develop a pairwise classification framework for face recognition, in which a class face recognition problem is divided into a set of ? ?? ? two class problems. Such a problem...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
113
click to vote
TMC
2010
14 years 9 months ago
2010
—Throughput optimization in wireless networks with multiple channels and multiple radio interfaces per node is a challenging problem. For general traffic models (given a set of ...