Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Ishadutta Yadav"'
Autor:
Zeng Yongbo, Satyanarayana Reddy Janga, Ishadutta Yadav, Krishnan Michael, Badeau Garrett James, Thornburg Ethan James, Sergey Tolkachov, Potter Andrew George, Brendan Kitts
Publikováno v:
KDD
Ad-servers have to satisfy many different targeting criteria, and the combination can often result in no feasible solution. We hypothesize that advertisers may be defining these metrics to create a kind of "proxy target". We therefore reformulate the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d08431d3297841236506c03fe2d6b935
https://doi.org/10.1145/3097983.3098085
https://doi.org/10.1145/3097983.3098085
Publikováno v:
Proceedings of the International Symposium on Biocomputing.
The problem of searching occurrences of a pattern P[0...m-1] in the text T[0...n-1>with m ≤ n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact string matching problem. In the present day, pattern matching is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2981fa122d889c70467a6289fe3a8e8
https://doi.org/10.1145/1722024.1722077
https://doi.org/10.1145/1722024.1722077
Publikováno v:
Bangalore Compute Conf.
The problem of searching occurrences of a pattern P[0...m-1] in the text T[0...n-1] with m ≤ n, where the symbols of P and T are drawn from some alphabet Σ of size σ, is called exact string matching problem. The problem of searching a set of patt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b559fef7507e885cd0ecce2290dbc81f
https://doi.org/10.1145/1754288.1754298
https://doi.org/10.1145/1754288.1754298
Publikováno v:
ARTCom
Word matching problem is to find all the occurrences of a pattern P[0…m-1] in the text T[0…n-1], where P neither contains any white space nor preceded and followed by space. In the multi-patterns word matching problem, all the occurrences of mult
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46c1e36cc2952f2a5dad0644f07bb926
https://doi.org/10.1109/artcom.2009.211
https://doi.org/10.1109/artcom.2009.211
Publikováno v:
ARTCom
Word matching problem is to find all the occurrences of a pattern P[0…m-1] in the text T[0…n-1], where P neither contains any white space nor preceded and followed by space. In this paper, we assume that our text is offline. Ibrahiem et al. in 20
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51e685ef7dff4f4392b2212060247330
https://doi.org/10.1109/artcom.2009.210
https://doi.org/10.1109/artcom.2009.210