Results 291 to 300 of about 760,132 (338)
Constructing an Index of Difficulty for Air Traffic Control Using Proximity Parameters
Procedia Engineering, 2015 Mark Brown
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Indexed fast network proximity querying
Proceedings of the VLDB Endowment, 2018Node proximity queries are among the most common operations on network databases. A common measure of node proximity is random walk based proximity, which has been shown to be less susceptible to noise and missing data. Real-time processing of random-walk based proximity queries poses significant computational challenges for larger graphs with over ...
Mustafa Coskun +2 more
openaire +1 more source
Indexing OODB instances based on access proximity
Proceedings 13th International Conference on Data Engineering, 2002Queries in object-oriented databases (OODBs) may be asked with respect to different class scopes: a query may either request for object-instances which belong exclusively to a given class c, or those which belong to any class in the hierarchy rooted at c.
Chee Yong Chan +2 more
openaire +1 more source
Palmar (Displaced) Fracture of the Proximal Index Metacarpal
Journal of Orthopaedic Trauma, 1999A patient sustained a fracture of the ulnar side of the proximal end of the second metacarpal. The fragment was completely displaced into the palmar soft tissues. Open reduction was necessary.
C J, Lang, J A, Ogden
openaire +2 more sources
Distance based indexing for string proximity search
Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405), 2004In many database applications involving string data, it is common to have near neighbor queries (asking for strings that are similar to a query string) or nearest neighbor queries (asking for strings that are most similar to a query string). The similarity between strings is defined in terms of a distance function determined by the application domain ...
Süleyman Cenk Sahinalp +3 more
openaire +1 more source
Density index and proximity search in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management, 2012Given a large real-world graph where vertices are associated with labels, how do we quickly find interesting vertex sets according to a given query? In this paper, we study label-based proximity search in large graphs, which finds the top-k query-covering vertex sets with the smallest diameters. Each set has to cover all the labels in a query. Existing
Nan Li +3 more
openaire +1 more source
Scalable proximity indexing with the list of clusters
2014 IEEE International Autumn Meeting on Power, Electronics and Computing (ROPEC), 2014In a wide spectrum of computer applications, the central problem is to satisfy proximity queries in a database of abstract objects under a given distance. That is, to find objects near a given query. Above certain size-threshold, a sequential scan of the database is too costly to be of use and an index should be used.
Eric S. Tellez +2 more
openaire +1 more source
Proximate composition and glycaemic index of destarched rice
Nigerian Journal of Basic and Applied Sciences, 2022There is strong evidence linking low glycaemic diets and reduced risk of developing diabetes mellitus (DM). This study was designed to develop low glycaemic index (GI) food using rice. Rice was subjected to enzymatic treatment at 40 °C for 8 mins for destarching.
Muhammad, S. A. +5 more
openaire +2 more sources
RRSi: indexing XML data for proximity twig queries
Knowledge and Information Systems, 2008Twig query pattern matching is a core operation in XML query processing. Indexing XML documents for twig query processing is of fundamental importance to supporting effective information retrieval. In practice, many XML documents on the web are heterogeneous and have their own formats; documents describing relevant information can possess different ...
Patrick K. L. Ng, Vincent T. Y. Ng
openaire +1 more source