25 search results - page 5 / 5 » cpm 2009 |
CPM
2009
Springer
14 years 12 days ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
CPM
2009
Springer
14 years 12 days ago
2009
Springer
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
CPM
2009
Springer
14 years 12 days ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
CPM
2009
Springer
14 years 12 days ago
2009
Springer
The haplotype inference problem (HIP) asks to find a set of haplotypes which resolve a given set of genotypes. This problem is of enormous importance in many practical fields, su...
WWW
2009
ACM
14 years 6 months ago
2009
ACM
Motivated by the emergence of auction-based marketplaces for display ads such as the Right Media Exchange, we study the design of a bidding agent that implements a display adverti...