Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Lelde Lāce"'
Publikováno v:
The Semantic Web: ESWC 2022 Satellite Events ISBN: 9783031116087
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bb7bfb6d91b1e592d60cb231dc5dcde
https://doi.org/10.1007/978-3-031-11609-4_2
https://doi.org/10.1007/978-3-031-11609-4_2
Publikováno v:
Metadata and Semantic Research ISBN: 9783030988753
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4cfc975d47e9b3b6ce4911ac36d2ece0
https://doi.org/10.1007/978-3-030-98876-0_2
https://doi.org/10.1007/978-3-030-98876-0_2
Publikováno v:
The Semantic Web: ESWC 2021 Satellite Events ISBN: 9783030804176
ESWC (Satellite Events)
ESWC (Satellite Events)
We describe and demonstrate the process of extracting a data-driven schema of the Europeana cultural heritage Linked data resource (with actual data classes, properties and their connections, and cardinalities) and application of the extracted schema
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7802989a417f16b9a1aa07a646feef77
https://doi.org/10.1007/978-3-030-80418-3_15
https://doi.org/10.1007/978-3-030-80418-3_15
Autor:
Jūlija Ovčiņņikova, Artūrs Sproģis, Mikus Grasmanis, Aiga Romāne, Kārlis Čerāns, Agris Sostaks, Lelde Lāce
Publikováno v:
Metadata and Semantic Research ISBN: 9783030365981
MTSR
MTSR
We present the option to use the schema-based visual query tool ViziQuer over realistic Linked Data endpoints. We describe the tool meta-schema structure and the means for the endpoint schema retrieval both from an OWL ontology and from a SPARQL endp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1902d35a7c63425428364ece185c8ec4
https://doi.org/10.1007/978-3-030-36599-8_18
https://doi.org/10.1007/978-3-030-36599-8_18
Autor:
Kārlis Čerāns, Artūrs Sproģis, Juris Bārzdiņš, Lelde Lāce, Agris Sostaks, Uldis Bojārs, Mikus Grasmanis, Jūlija Ovčiņņikova
Publikováno v:
Metadata and Semantic Research ISBN: 9783030144005
MTSR
MTSR
Visual SPARQL query notations aim at easing the RDF data querying task. At the current state of the art there is still no generally accepted visual graph-based notation suitable to describe RDF data analysis queries that involve aggregation and subqu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::80e78233c4aaed2ba791b6ead35fbefc
https://doi.org/10.1007/978-3-030-14401-2_5
https://doi.org/10.1007/978-3-030-14401-2_5
Autor:
Kārlis Čerāns, Aiga Romāne, Agris Sostaks, Artūrs Sproģis, Uldis Bojārs, Juris Bārzdiņš, Jūlija Ovčiņņikova, Mikus Grasmanis, Lelde Lāce
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319981918
ESWC (Satellite Events)
ESWC (Satellite Events)
We demonstrate the open source ViziQuer tool for web-based creation and execution of visual diagrammatic queries over RDF/SPARQL data. The tool supports the data instance level and statistics queries, providing visual counterparts for most of SPARQL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ee42802e31d81165585a9e724f23cd4b
https://doi.org/10.1007/978-3-319-98192-5_30
https://doi.org/10.1007/978-3-319-98192-5_30
Autor:
Paulis Ķikusts, Kārlis Freivalds, Mārtiņš Opmanis, Juris Vīksna, Dārta Rituma, Gatis Melkus, Pēteris Ručevskis, Edgars Celms, Lelde Lāce, Kārlis Čerāns
Publikováno v:
Communications in Computer and Information Science ISBN: 9783319975702
DB&IS
DB&IS
In this paper we present an approach based on integrated use of graph clustering and visualisation methods for semi-supervised discovery of biologically significant features in biomolecular data sets. We describe several clustering algorithms that ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15d4b5ab0d262c73cd0cd4098ac0e5c8
https://doi.org/10.1007/978-3-319-97571-9_20
https://doi.org/10.1007/978-3-319-97571-9_20
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642135224
UC
UC
Postselection for quantum computing devices was introduced by S. Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7c743db0b95f54207eff8930552c911d
https://doi.org/10.1007/978-3-642-13523-1_14
https://doi.org/10.1007/978-3-642-13523-1_14
Autor:
Lelde Lāce
Elektroniskā versija nesatur pielikumus
LELDE LĀCE KVANTU VAICĀJOŠIE ALGORITMI ANOTĀCIJA Kvantu skaitļošana ir datorzinātņu apakšnozare, kurā tiek izmantotas kvantu mehānikas īpatnības, lai efektīvāk risinātu skaitļošanas uzde
LELDE LĀCE KVANTU VAICĀJOŠIE ALGORITMI ANOTĀCIJA Kvantu skaitļošana ir datorzinātņu apakšnozare, kurā tiek izmantotas kvantu mehānikas īpatnības, lai efektīvāk risinātu skaitļošanas uzde
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1d471942448a84852fd375599d850478
https://dspace.lu.lv/dspace/handle/7/4536
https://dspace.lu.lv/dspace/handle/7/4536
Autor:
Elīna Kalniņa, Jevgeņijs Ivanovs, Lelde Lāce, Daina Taimiņa, Hisayuki Tatsumi, Rūsiņš Freivalds, Raitis Ozols, Masahiro Miyakawa
Publikováno v:
SOFSEM 2005: Theory and Practice of Computer Science ISBN: 9783540243021
SOFSEM
Scopus-Elsevier
SOFSEM
Scopus-Elsevier
The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sough
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8ae668799843d68e9a34254016b60dd0
https://doi.org/10.1007/978-3-540-30577-4_50
https://doi.org/10.1007/978-3-540-30577-4_50