52 search results - page 2 / 11 » Finding the maximum and minimum elements with one lie |
BMCBI
2010
13 years 5 months ago
2010
Background: Because a priori knowledge about function of G protein-coupled receptors (GPCRs) can provide useful information to pharmaceutical research, the determination of their ...
ISAAC
1997
Springer
13 years 9 months ago
1997
Springer
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
IJCV
2006
13 years 5 months ago
2006
: Shape recognition is the field of computer vision which addresses the problem of finding out whether a query shape lies or not in a shape database, up to a certain invariance. Mo...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
— A novel singular value decomposition (SVD) aided uplink (UL) multiuser MIMO system is proposed. In contrast to the traditional minimum mean square error (MMSE) or zeroforcing (...
SODA
1990
ACM
13 years 6 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...