9,155 Hits in 4.4 sec

Computing thejth solution of a first-order query

Guillaume Bagan, Arnaud Durand, Etienne Grandjean, Frédéric Olive
2008 RAIRO - Theoretical Informatics and Applications  
order y0 < y1 < · · · < yn−1 where R(x) = {y0, . . . , yn−1}; compute the solution yj of rank j in the linear order <.  ...  S, a) |= ϕ(v)}; (2) compute the j th element of ϕ(S) for some linear order of ϕ(S); (3) enumerate the elements of ϕ(S) in lexicographical order.  ...  Query problems We are interested in the problems described in the previous section in the context of first-order queries.  ... 
doi:10.1051/ita:2007046 fatcat:ab3ki2rkufa4hbk5l7bej7fmoy

An Efficient Online Multiparty Interactive Medical Prediagnosis Scheme with Privacy Protection

Qiuyue Zhang, Xiao Zheng, Xiujun Wang, Yushu Zhang
2021 Wireless Communications and Mobile Computing  
Due to the privacy of patient medical information and the sensitivity of cloud diagnosis models, it is necessary to protect the security of data, models, and communications.  ...  Extensive experimental results demonstrate that OMPD not only greatly improves the diagnostic accuracy but also reduces the computational and communication overhead.  ...  PPDP generates a lot of computation and communica- the other three schemes.  ... 
doi:10.1155/2021/7746286 fatcat:c6w6tlehxfbttkwhgpsq6avsia

Personalized web search for improving retrieval effectiveness

Fang Liu, C. Yu, Weiyi Meng
2004 IEEE Transactions on Knowledge and Data Engineering  
These two profiles are combined to map a user query into a set of categories which represent the user's search intention and serve as a context to disambiguate the words in the user's query.  ...  Web search is conducted based on both the user query and the set of categories. Several profile learning and category mapping algorithms and a fusion algorithm are provided and evaluated.  ...  ACKNOWLEDGMENTS A preliminary version of this paper (but not containing the part on how the categories can be used to improve retrieval effectiveness) has been published in the Proceedings of the ACM Conference  ... 
doi:10.1109/tkde.2004.1264820 fatcat:c4ebqptkibhexlv5n3fki4nksm

An Efficient Alignment Algorithm for Searching Simple Pseudoknots over Long Genomic Sequence

Christopher Ma, Thomas K.F. Wong, T.W. Lam, W.K. Hon, K. Sadakane, S.M. Yiu
2012 IEEE/ACM Transactions on Computational Biology & Bioinformatics  
The speedup stems from an effective pruning strategy consisting of the computation of a lower bound score for the optimal alignment and an estimation of the maximum score that a candidate can achieve to  ...  Even for the simplest type of pseudoknots (simple pseudoknots), the fastest algorithm runs in Oðmn 3 Þ time, where m, n are the length of the query ncRNA (with known structure) and the length of the target  ...  First we try to compute a lower bound of the optimal semiglobal alignment score (c) between S and T .  ... 
doi:10.1109/tcbb.2012.104 pmid:22868682 fatcat:h3wnsleldrf3pdrarmctdibpii

An Efficient Methodology for the Evaluations of Select Operation in Query Optimization

Syed NaimatullahHussain, Sultan Aljahdali, Ashfaq Ahmed K
2013 International Journal of Computer Applications  
The query processing and optimization manages these transformations, by transforming 4GLs query into appropriate relational algebra/calculus expression in the first phase, minimizing the operations in  ...  The development of 4GLs freed the users from the strained design of 'how to do it' for solutions of their applications.  ...  Algorithm (B-tree selection) /* The order of B-tree is p, q is the number of tree pointers in the node at the jth level [4, 7] . Pij is the tree pointer to ith index at jth level.  ... 
doi:10.5120/11973-7829 fatcat:kxpo2qumfzcjtd227c2lkgteqy

Multidimensional Data Structures and Techniques for Efficient Decision Making

Madalina Ecaterina Andreica, Mugurel Ionut Andreica, Nicolae Cataniciu
2010 arXiv   pre-print
We consider online range aggregation, range selection and range weighted median queries; for most of them, the presented data structures and techniques can provide answers in polylogarithmic time.  ...  The presented results have applications in many business and economic scenarios, some of which are described in detail in the paper.  ...  In order to answer range weighted median number of points p whose weight is at most wt. if p≥k, queries, we will first construct d data cubes with the then wt≥wk; otherwise, wt<wk.  ... 
arXiv:1001.1454v1 fatcat:dm642lhut5bl3bgymzyxa6bi3u

Distance-Aware Selective Online Query Processing Over Large Distributed Graphs

Xiaofei Zhang, Lei Chen
2017 Data Science and Engineering  
Performing online selective queries against graphs is a challenging problem due to the unbounded nature of graph queries which leads to poor computation locality.  ...  instead of the query efficiency.  ...  Based on this observation, given a range of possible jp st j, a brute-force solution is to check all possible values of jp st j in an ascending order and report the first valid result as the correct jp  ... 
doi:10.1007/s41019-016-0023-z fatcat:gruu7zd65fdfvoopqeclqbx3ku

Quantum Private Queries

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone
2008 Physical Review Letters  
It allows a user to retrieve an item from the server in possession of the database without revealing which item she retrieved: if the server tries to obtain information on the query, the person querying  ...  Furthermore our protocol ensures perfect data privacy of the database, i.e. the information that the user can retrieve in a single queries is bounded and does not depend on the size of the database.  ...  She starts by measuring the first two, in order to find out the values of A j and A k : the former is the answer she was looking for, the latter will be used to prepare a measurement to test the third  ... 
doi:10.1103/physrevlett.100.230502 pmid:18643478 fatcat:cv5irylpdrhu5dbbekiifhewz4

Secure Outsourced Top-k Selection Queries against Untrusted Cloud Service Providers

Xixun Yu, Yidan Hu, Rui Zhang, Zheng Yan, Yanchao Zhang
2021 2021 IEEE/ACM 29th International Symposium on Quality of Service (IWQOS)  
Detailed simulation studies using a real dataset confirm the efficacy and efficiency of the proposed schemes and their significant advantages over prior solutions.  ...  As cloud computing reshapes the global IT industry, an increasing number of business owners have outsourced their datasets to third-party cloud service providers (CSP), which in turn answer data queries  ...  ACKNOWLEDGEMENT The authors would like to thank the anonymous reviewers for their constructive comments and helpful advice.  ... 
doi:10.1109/iwqos52092.2021.9521321 fatcat:vur5njty2zalxomyv7jajzafc4

Enumerating with constant delay the answers to a query

Luc Segoufin
2013 Proceedings of the 16th International Conference on Database Theory - ICDT '13  
We survey classes of databases and classes of queries for which this is possible. We also mention related problems such as computing the number of answers or sampling the set of answers.  ...  We survey recent results about enumerating with constant delay the answers to a query over a database.  ...  Acknowledgment: We are grateful to Cristina Sirangelo, Arnaud Durand, Wojtek Kazana and Yann Strozecki for their valuable comments on earlier version of this paper.  ... 
doi:10.1145/2448496.2448498 dblp:conf/icdt/Segoufin13 fatcat:knkcl5pm2vebjfc5o6erez3yuu

Content-based retrieval for human motion data

Chih-Yi Chiu, Shih-Pin Chao, Ming-Yang Wu, Shi-Nine Yang, Hsin-Chih Lin
2004 Journal of Visual Communication and Image Representation  
In matching, the start and end frames of a query example are first indexed into index maps to find candidate clips from the given motion collection.  ...  Then the similarity between the query example and each candidate clip is computed through dynamic time warping.  ...  of Tai Chi Chuan.  ... 
doi:10.1016/j.jvcir.2004.04.004 fatcat:xqjkbuzcxnh3jiwqi673y7oqh4

Soft approaches to distributed information retrieval

Gloria Bordogna, Gabriella Pasi, R.R. Yager
2003 International Journal of Approximate Reasoning  
In both situations we have the problem of merging the results produced by the distinct IRS into a unique ordered list, which constitutes the unified answer to the user query.  ...  The second aspect is to define a procedure to fuse the individual lists of retrieved documents into an overall ordered list.  ...  The matching procedure of a Boolean query against the fuzzy prototypal term set proceeds in a bottom up way: first, the membership of each query term to the prototypal fuzzy set is computed.  ... 
doi:10.1016/j.ijar.2003.07.003 fatcat:kteugbll2bcphiykhx2t6oay7i

Cache-Oblivious Iterated Predecessor Queries via Range Coalescing [chapter]

Erik D. Demaine, Vineet Gopal, William Hasenplaugh
2015 Lecture Notes in Computer Science  
Our solution to this problem, called "range coalescing", requires O(log B+1 n + k/B) memory transfers for a query on a cache of block size B, which is information-theoretically optimal.  ...  . , L k of average length n and a query value q, the iterated predecessor problem is to find the largest element in each list which is less than q.  ...  We thank the other participants for making a creative and productive environment.  ... 
doi:10.1007/978-3-319-21840-3_21 fatcat:a2mvycosyvhm7kphnmcypvl4um

Enzymatic target identification with dynamic states

Bin Song, Sanjay Ranka, Tamer Kahveci
2010 Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology - BCB '10  
They also show that our partitioning strategy reduces the number of time intervals computed for dynamic states by a factor of 2 to 6.  ...  Euclidean distance restricts the solution space to the exact goal state. Time-warping distance allows for stretching of the goal pattern in the time domain.  ...  This ensures that there is a solution to the dynamic enzymatic target identification problem for each query with zero distance.  ... 
doi:10.1145/1854776.1854804 dblp:conf/bcb/SongRK10 fatcat:yj45jpob5reyzpuckdmbjc7en4

GPU-based Acceleration of Methods based on Clock Matching Metric for Large Scale 3D Shape Retrieval

Mohammed Benjelloun, El Wardani Dadi, El Mostafa Daoudi
2018 Scalable Computing : Practice and Experience  
Indeed, the massive parallelism of the GPU offers a huge performance in much high-performance computing (HPC) applications.  ...  In this paper, we exploit the potential of the GPU in order to accelerate the process of 3D shape retrieval in large databases.  ...  The first one consists to compute the descriptor of a given 3D object while the second one, consists to compare the query object with the 3D models in the database.  ... 
doi:10.12694/scpe.v19i1.1391 fatcat:lk2wwpf52nhj7gcbquwzf4ximq
« Previous Showing results 1 — 15 out of 9,155 results