Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Fuad Jamour"'
Publikováno v:
International Journal of Semantic Computing. 15:419-439
Most existing commercial goal-oriented chatbots are diagram-based; i.e. they follow a rigid dialog flow to fill the slot values needed to achieve a user’s goal. Diagram-based chatbots are predictable, thus their adoption in commercial settings; how
Publikováno v:
CIKM
Frequently Asked Questions (FAQ) are a form of semi-structured data that provides users with commonly requested information and enables several natural language processing tasks. Given the plethora of such question-answer pairs on the Web, there is a
Publikováno v:
SIGIR
Identifying user intents from natural language utterances is a crucial step in conversational systems that has been extensively studied as a supervised classification problem. However, in practice, new intents emerge after deploying an intent detecti
Publikováno v:
WWW
Slot filling is identifying contiguous spans of words in an utterance that correspond to certain parameters (i.e., slots) of a user request/query. Slot filling is one of the most important challenges in modern task-oriented dialog systems. Supervised
Publikováno v:
ICSC
Most existing commercial goal-oriented chatbots are diagram-based; i.e., they follow a rigid dialog flow to fill the slot values needed to achieve a user's goal. Diagram-based chatbots are predictable, thus their adoption in commercial settings; howe
Publikováno v:
IEEE BigData
Hundreds of thousands of mobile app users post their reviews online. Responding to user reviews promptly and satisfactorily improves application ratings, which is key to application popularity and success. The proliferation of such reviews makes it v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd4ed5ef7fb6aa7d14bcc82c3ba45b17
http://arxiv.org/abs/2007.15793
http://arxiv.org/abs/2007.15793
Publikováno v:
Proceedings of the VLDB Endowment. 11:1978-1981
Existing RDF engines follow one of two design paradigms: relational or graph-based. Such engines are typically designed for specific hardware architectures, mainly CPUs, and are not easily portable to new architectures. Porting an existing engine to
Publikováno v:
IEEE Transactions on Parallel and Distributed Systems. 29:659-672
Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the com
Publikováno v:
EuroSys
Existing query engines for RDF graphs follow one of two design paradigms: relational or graph-based. We explore sparse matrix algebra as a third paradigm and propose MAGiQ: a framework for implementing SPARQL query engines that are portable on variou
Publikováno v:
SSDBM
Betweenness centrality quantifies the importance of graph nodes in a variety of applications including social, biological and communication networks. Its computation is very costly for large graphs; therefore, many approximate methods have been propo