196 search results - page 25 / 40 » Approximating weighted matchings in parallel |
CVPR
1996
IEEE
15 years 1 months ago
1996
IEEE
We study the problem of how to detect \interesting objects" appeared in a given image, I. Our approach is to treat it as a function approximation problem based on an over-red...
79
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Millions of DNA sequences (reads) are generated by Next Generation Sequencing machines everyday. There is a need for high performance algorithms to map these sequences to the refer...
84
Voted
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
99
Voted
MM
2005
ACM
15 years 3 months ago
2005
ACM
Graphics and vision are approximate inverses of each other: ordinarily Graphics Processing Units (GPUs) are used to convert “numbers into pictures” (i.e. computer graphics). I...
ICTCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...