4212 search results - page 591 / 843 » On Compressible Pairings and Their Computation |
158
click to vote
RECOMB
2002
Springer
16 years 7 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...
245
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
201
Voted
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Due to noise, overlapped text/signature and multi-oriented nature, seal (stamp) object detection involves a difficult challenge. This paper deals with automatic detection of seal ...
206
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
175
click to vote
PDP
2009
IEEE
16 years 1 months ago
2009
IEEE
Existing approaches for modelling the Internet delay space predict end-to-end delays between two arbitrary hosts as static values. Further, they do not capture the characteristics...