2127 search results - page 85 / 426 » Computing large matchings fast |
128
Voted
WSCG
2001
15 years 5 months ago
2001
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
139
Voted
ICDCS
2009
IEEE
16 years 24 days ago
2009
IEEE
With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today’s large-scale distributed systems. Usually, the correlatio...
110
Voted
IMR
2004
Springer
15 years 9 months ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
126
Voted
BIBM
2008
IEEE
15 years 5 months ago
2008
IEEE
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
227
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
We present algorithms for fast quantile and frequency estimation in large data streams using graphics processor units (GPUs). We exploit the high computational power and memory ba...