Results 211 to 220 of about 157,946 (258)
Accelerating Active Learning for Image Classification Through FPGA-Based Implementation. [PDF]
Sensors (Basel)Barbieri A +3 more
europepmc +1 more source
DC-RAG: a dual-channel retrieval-augmented generation framework for audit analysis. [PDF]
Sci RepXing C, Meng H.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the 27th ACM International Conference on Information and Knowledge Management, 2018
The range skyline query retrieves the dynamic skyline for every individual query point in a range by generalizing the point-based dynamic skyline query. Its wide-ranging applications enable users to submit their preferences within an interval of 'ideally sought' values across every dimension, instead of being limited to submit their preference in ...
Theodoros Tzouramanis +3 more
openaire +1 more source
The range skyline query retrieves the dynamic skyline for every individual query point in a range by generalizing the point-based dynamic skyline query. Its wide-ranging applications enable users to submit their preferences within an interval of 'ideally sought' values across every dimension, instead of being limited to submit their preference in ...
Theodoros Tzouramanis +3 more
openaire +1 more source
Are window queries representative for arbitrary range queries?
Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1996In this paper, we characterize the eciency of spatial access structures in terms of the expected number of data bucket accesses needed to perform a range query. We derive performance formulas for various kinds of range queries like intersection, containment, and enclosure queries with dierent geometric shapes.
Bernd-Uwe Pagel, Hans-Werner Six
openaire +1 more source
Uncertain Range Queries for Necklaces
2010 Eleventh International Conference on Mobile Data Management, 2010We address the problem of efficient processing of spatio-temporal range queries for moving objects whose whereabouts in time are not known exactly. The fundamental question tackled by such queries is, given a spatial region and a temporal interval, retrieve the objects that were inside the region during the given interval.
Goce Trajcevski +4 more
openaire +1 more source
2013
Efficient correlation computation has been an active research area of data mining. Given a large dataset and a specified query item, we are interested in finding items in the dataset that are within certain range of correlation with the query item. Such a problem, known as the correlation range query (CRQ), has been a common task in many application ...
Wenjun Zhou 0001, Hao Zhang 0011
openaire +1 more source
Efficient correlation computation has been an active research area of data mining. Given a large dataset and a specified query item, we are interested in finding items in the dataset that are within certain range of correlation with the query item. Such a problem, known as the correlation range query (CRQ), has been a common task in many application ...
Wenjun Zhou 0001, Hao Zhang 0011
openaire +1 more source
Maintenance of Range Skyline Query
2020 IEEE International Conference on Knowledge Graph (ICKG), 2020Skyline query has attracted much attention from the data management community. It is widely used in many practical applications, such as multi-criteria decision-making, product recommendations, and decision analysis. The range skyline query retrieves skyline results for each query point in the specified range, which means that users can set their ideal
Xiaoxue Li +3 more
openaire +1 more source
2013
Array range queries are of current interest in the field of data structures. Given an array of numbers or arbitrary elements, the general array range query problem is to build a data structure that can efficiently answer queries of a given type stated in terms of an interval of the indices.
openaire +1 more source
Array range queries are of current interest in the field of data structures. Given an array of numbers or arbitrary elements, the general array range query problem is to build a data structure that can efficiently answer queries of a given type stated in terms of an interval of the indices.
openaire +1 more source
A Concise Representation of Range Queries
2009 IEEE 25th International Conference on Data Engineering, 2009With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PDAs. Range queries, as one of the most commonly used tools, are often posed by the users to retrieve needful information from a spatial database.
Ke Yi 0001 +3 more
openaire +1 more source
Approximate Colored Range Queries
2005In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate sketching techniques on our framework, we obtained efficient data structures that provide approximate solutions to these problems. In addition, the framework can be employed
Ying Kit Lai +2 more
openaire +1 more source