484 search results - page 28 / 97 » Large graph processing in the cloud |
183
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
56
Voted
ACL
1998
14 years 11 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
RP
2010
Springer
14 years 7 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
KONVENS
2000
15 years 1 months ago
2000
This paper presents details of the RWTH large vocabulary continuous speech recognition system used in the VERBMOBIL spontaneous speech translation system. In particular, we report...
SEMWEB
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisi...