Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Fangqiu Han"'
Publikováno v:
Fire Technology. 55:517-545
Quantifying factors that affect evacuation decision making remains a challenging task. Progress is crucial for developing predictive models of collective behavior and for designing effective policies to guide the action of populations during wildfire
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bbdfb1e5c0373a2bfa61b0946f16508
https://doi.org/10.1007/s10694-018-0770-7
https://doi.org/10.1007/s10694-018-0770-7
Publikováno v:
WWW (Companion Volume)
Making friend recommendations is an important task for social networks, as having more friends typically leads to a better user experience. Most current friend recommendations systems grow the existing network at the cost of privacy. In particular, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb8e9e4b04a3946031dd9792e5ec7802
https://doi.org/10.1145/3184558.3186954
https://doi.org/10.1145/3184558.3186954
Publikováno v:
Algorithmica. 76:474-489
We consider a graph observability problem: how many edge colors are needed for an unlabeled graph so that an agent, walking from node to node, can uniquely determine its location from just the observed color sequence of the walk? Specifically, let G(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccc2bba92afad31de69f4dbd87e3d126
https://doi.org/10.1007/s00453-015-0049-z
https://doi.org/10.1007/s00453-015-0049-z
Publikováno v:
Proceedings of the VLDB Endowment. 6:169-180
Massively parallel DNA sequencing technologies are revolutionizing genomics research. Billions of short reads generated at low costs can be assembled for reconstructing the whole genomes. Unfortunately, the large memory footprint of the existing de n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d833ea5b394536899183aeb07a7f913
https://doi.org/10.14778/2535569.2448951
https://doi.org/10.14778/2535569.2448951
Publikováno v:
ICDE
Given a graph query Q posed on a knowledge graph G, top-k graph querying is to find k matches in G with the highest ranking score according to a ranking function. Fast top-k search in knowledge graphs is challenging as both graph traversal and simila
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ce73e8106bfdcb31b9c07822f6469e2
https://doi.org/10.1109/icde.2016.7498307
https://doi.org/10.1109/icde.2016.7498307
Publikováno v:
ICDE
Motif discovery in sequence data is fundamental to many biological problems such as antibody biomarker identification. Recent advances in instrumental techniques make it possible to generate thousands of protein sequences at once, which raises a big
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf7775d82dc21b4594a4155e67c34227
https://doi.org/10.1109/icde.2016.7498321
https://doi.org/10.1109/icde.2016.7498321
Publikováno v:
Optimization Letters. 6:1551-1571
This paper considers classical online scheduling problems on uniform machines. We show the tight competitive ratio of LS for any combinations of speeds of three machines. We prove that LS is optimal when s3 ≥ s2 ≥ s1 = 1 and \({s_3^2\geq s_2^2+s_
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8aa8f17c1717fc5fd7ee520ebf00274
https://doi.org/10.1007/s11590-011-0335-x
https://doi.org/10.1007/s11590-011-0335-x
Publikováno v:
KDD
Named entity disambiguation is the task of disambiguating named entity mentions in natural language text and link them to their corresponding entries in a knowledge base such as Wikipedia. Such disambiguation can help enhance readability and add sema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6880fca7deafc9081830ac7ddaf9fddd
https://doi.org/10.1145/2487575.2487681
https://doi.org/10.1145/2487575.2487681