Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Kosetsu Ikeda"'
Publikováno v:
IEICE transactions on information and systems. (4):944-958
In this paper, we consider solving the all-pairs regular path problem on large graphs efficiently. Let G be a graph and r be a regular path query, and consider finding the answers of r on G. If G is so small that it fits in main memory, it suffices t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88f903ac1666e47ee9332690a1a76103
https://tsukuba.repo.nii.ac.jp/records/38404
https://tsukuba.repo.nii.ac.jp/records/38404
Autor:
Nobutaka Suzuki, Kosetsu Ikeda
Publikováno v:
IPSJ Online Transactions. 7:69-81
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3d4cdd439e25fd88c8af724316ae861f
https://doi.org/10.2197/ipsjtrans.7.69
https://doi.org/10.2197/ipsjtrans.7.69
Publikováno v:
IEICE transactions on information and systems. (5):1029-1042
In this paper, we consider the XPath satisfiability problem under restricted DTDs called “duplicate free”. For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc41c3f4822a6be5a06acf4be46431b8
https://tsukuba.repo.nii.ac.jp/records/29198
https://tsukuba.repo.nii.ac.jp/records/29198
Autor:
Gautam Das, Saravanan Thirumuruganathan, Habibur Rahman, Senjuti Basu Roy, Sihem Amer-Yahia, Kosetsu Ikeda, Atsuyuki Morishima
Publikováno v:
VLDB 2016 : 42nd international conference on very large data bases
VLDB 2016 : 42nd international conference on very large data bases, Sep 2016, New Delhi, India. pp.1497-1500
VLDB 2016 : 42nd international conference on very large data bases, Sep 2016, New Delhi, India. pp.1497-1500
Collaborative crowdsourcing is an emerging paradigm where a set of workers, often with diverse and complementary skills, form groups and work together to complete complex tasks. While crowdsourcing has been used successfully in many applications, col
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17cb7ef341a15ace3a17cdfeeef281c4
https://hal.archives-ouvertes.fr/hal-02000557
https://hal.archives-ouvertes.fr/hal-02000557
Publikováno v:
iConference 2016 Proceedings.
The problem of dividing a given set of data items into groups in the situation that the given input is not su cient to solve it has a wide range of applications. However, the problem cannot be solved by computers alone. This paper defines the Bookshe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a44d62999f9b5506e96297cb900496b8
https://doi.org/10.9776/16194
https://doi.org/10.9776/16194
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319228518
DEXA (2)
DEXA (2)
In this paper, we consider solving the all-pairs regular path problem on large graphs efficiently. Let G be a graph and r be a regular path query, and consider finding the answers of r on G. If G is so small that it fits in main memory, it suffices t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::578ea49ed52946c0eefb0f764af879eb
https://doi.org/10.1007/978-3-319-22852-5_34
https://doi.org/10.1007/978-3-319-22852-5_34
Autor:
Nobutaka Suzuki, Kosetsu Ikeda
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642325991
DEXA (1)
DEXA (1)
Suppose that we have a DTD D and XML documents valid against D, and consider writing an XPath query to the documents. Unfortunately, a user often does not understand the entire structure of D exactly, especially in the case where D is very large and/
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9143f46415eae42515c2a8054c588b18
https://doi.org/10.1007/978-3-642-32600-4_10
https://doi.org/10.1007/978-3-642-32600-4_10