1871 search results - page 216 / 375 » The Ephemeral Pairing Problem |
185
click to vote
CHI
2005
ACM
16 years 7 months ago
2005
ACM
Providing instructions via handheld prompters holds much promise for supporting independence for persons with cognitive disabilities. Because users of these tools are paired ? car...
161
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
We have developed a multiple genome alignment algorithm by using a sequence clustering algorithm to combine local pairwise genome sequence matches produced by pairwise genome align...
150
click to vote
RECOMB
2002
Springer
16 years 6 months ago
2002
Springer
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
190
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
150
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...