Search alternatives:
sampling algorithm » scheduling algorithm (Expand Search)
fe algorithm » rd algorithm (Expand Search), deer algorithm (Expand Search), _ algorithms (Expand Search)
elements fe » elements _ (Expand Search), elementi per (Expand Search)
tree » three (Expand Search), free (Expand Search)
sampling algorithm » scheduling algorithm (Expand Search)
fe algorithm » rd algorithm (Expand Search), deer algorithm (Expand Search), _ algorithms (Expand Search)
elements fe » elements _ (Expand Search), elementi per (Expand Search)
tree » three (Expand Search), free (Expand Search)
-
1
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
2
Approximate XML structure validation based on document–grammar tree similarity
Published 2015“…Our approach exploits the concept of tree edit distance, introducing a novel edit distance recurrence and dedicated algorithms to effectively compare XML documents and grammar structures, modeled as ordered labeled trees. …”
Get full text
Get full text
Get full text
Get full text
article -
3
Brain Source Localization in the Presence of Leadfield Perturbations
Published 2015Get full text
doctoralThesis -
4
-
5
Structural similarity evaluation between XML documents and DTDs
Published 2007“…We consider the various DTD operators that designate constraints on the existence, repeatability and alternativeness of XML elements/attributes. Our approach is based on the concept of tree edit distance, as an effective and efficient means for comparing tree structures, XML documents and DTDs being modeled as ordered labeled trees. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
6
Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying
Published 2023“…The semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. …”
Get full text
Get full text
Get full text
Get full text
article -
7
Approximate XML structure validation technical report
Published 2014“…Our approach exploits the concept of tree edit distance, introducing a novel edit distance recurrence and dedicated algorithms to effectively compare XML documents and grammar structures, modeled as ordered labeled trees. …”
Get full text
Get full text
Get full text
article -
8
Corona power loss computation in bundled bipolar conductors
Published 2000“…In this paper, a finite element (FE) based algorithm devoted for the computation of the corona current and hence the corona power loss associated with bundled bipolar high voltage direct current (HVDC) conductors is presented. …”
Get full text
Get full text
article -
9
A Data-Driven Decision-Making Framework for Fleet Management in the Government Sector of Dubai
Published 2024“…My research aims to develop a data-driven decision support framework for fleet management, focusing on leveraging advanced algorithms, including decision trees and random forests, to generate domain-specific AI models. …”
Get full text
-
10
Autonomous Demand-Side Management in the Future Smart Grid
Published 2016Get full text
doctoralThesis -
11
XBeGene: Scalable XML Documents Generator by Example Based on Real Data
Published 2012“…Inspired by the query-by-example paradigm in information retrieval, Our generator system i)allows the user to provide her own sample XML documents as input, ii) analyzes the structure, occurrence frequencies, and content distributions for each XML element in the user input documents, and iii) produces synthetic XML documents which closely concur, in both structural and content features, to the user's input data. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
12
Assessing Factors Influencing Customers’ Adoption of AI-Based Voice Assistants
Published 2024“…It also provides implications for tech-managers and algorithm designers to build effective voice technology for superior user experience.…”