A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The Update Complexity of Selection and Related Problems
2015
Theory of Computing Systems
Preserved Fulltext
We address selection problems in the generalized model and show that there exist 2-update competitive algorithms that do not depend on the lengths or distribution of the sub-intervals and hold against ...
To compute a solution, the algorithm can query the input parameters that yield more refined estimates in form of sub-intervals and the objective is to minimize the number of queries. ...
update complexity of selection and related problems We categorize the valid models into 5 different categories (See Figure 1 ). ...
doi:10.1007/s00224-015-9664-y
fatcat:l4eedczdsnflvpw3ynkmitqjeq
The update complexity of selection and related problems
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
We address selection problems in the generalized model and show that there exist 2-update competitive algorithms that do not depend on the lengths or distribution of the sub-intervals and hold against ...
To compute a solution, the algorithm can query the input parameters that yield more refined estimates in form of sub-intervals and the objective is to minimize the number of queries. ...
We also study the update complexity of minimum spanning tree problem under the different models that is closely related to the extremal selection problem (finding the heaviest edge in a cycle -also called ...
arXiv:1108.5525v1
fatcat:62fzytwyq5er7ea37posmkpsni
Page 7888 of Mathematical Reviews Vol. , Issue 99k
[page]
1999
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The problem of index selection in the presence of multiple candidate indexes for each attribute (which we call the multiple choice index selection problem) has not been addressed in the literature. ...
The results provide insight into the programming paradigm of active databases, the inter- play of various features, and their impact on expressiveness and complexity.” ...
Data Selection in Neural Networks
2021
IEEE Open Journal of Signal Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The approach proposes a data-selection strategy applied to classification and regression problems leading to computational savings and classification error reduction. ...
In this paper, we propose a data selection strategy for the training step of Neural Networks to obtain the most significant data information and improve algorithm performance during training. ...
Moreover, the complexity of the data selection method is provided for both regression and classification problems. ...
doi:10.1109/ojsp.2021.3106197
fatcat:5f72xjcwsjfg7n3iut43iacnbi
Near optimal multiple choice index selection for relational databases
1999
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The problem of index selection in the presence of multiple candidate indexes for each attribute (which we call the multiple choice index selection problem) has not been addressed in the literature. ...
In the literature, in index selection algorithms for relational databases, at most one index is considered as a candidate for each attribute of a relation. ...
Given a disjoint set of indexes I= (to which Eliml.ation 1 is applied) for a relational database of relations U, the total cost of processing all the updates in UP and all the selections in S in the presence ...
doi:10.1016/s0898-1221(98)00256-9
fatcat:uqvfag6wvrh7tg5nyfuhx6fkwu
Updating Recursive XML Views of Relations
2008
Journal of Computer Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper investigates the view update problem for XML views published from relational data. ...
In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present efficient algorithms to translate XML updates to relational ...
Input: relations I 1 , ..., In, view V , a group insertion ∆ R , the view definition π P (σ C (R 1 × ... × Rn)), Output: side-effect encode or reject (exception) ...
doi:10.1007/s11390-008-9150-y
fatcat:jtb6vthgrjeyzndskv7rfupb7u
Updating Recursive XML Views of Relations
2007
2007 IEEE 23rd International Conference on Data Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper investigates the view update problem for XML views published from relational data. ...
In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present efficient algorithms to translate XML updates to relational ...
Input: relations I 1 , ..., In, view V , a group insertion ∆ R , the view definition π P (σ C (R 1 × ... × Rn)), Output: side-effect encode or reject (exception) ...
doi:10.1109/icde.2007.367922
dblp:conf/icde/ChoiCFV07
fatcat:pmr2pyjmqbdabkqjeyef7ugoxq
A Hybrid of Search Efficiency Mechanisms: Pruning Learning Heuristic Hybrid (PLH2)
2005
Journal of Intelligent Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Partial updating of the contents of facilitating data structures associated with the nodes reduces the search effort significantly. ...
The computational experiments show that PLH 2 efficiently tackles a practical problem of wide generality and the performance analysis indicates PLH 2 can present several advantages over A* under specific ...
When represented in problem space, every state of the RCPSP is a set of activities with all complexities related to a project, including precedence relations and resource requirements. ...
doi:10.1515/jisys.2005.14.4.265
fatcat:2h66h7zt6bbfjapatopmge27eq
MOVIE: An incremental maintenance system for materialized object views
2003
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
The evaluation throws light into how the effectiveness of incremental maintenance is affected by issues such as database size, and the complexity and selectivity of views. ...
So far, most work on this problem has been confined to relational settings and solutions have not been comprehensively evaluated. ...
The authors would like to thank Leonidas Fegaras for making available to the research community the k-DB system and for helping them make use of it. ...
doi:10.1016/s0169-023x(03)00048-x
fatcat:qduhhpdmlvaore7ewy6htnshoa
Updating executive function and performance in reading comprehension and problem solving. [La función ejecutiva de actualización y el rendimiento en comprensión lectora y resolución de problemas]
2015
Anales de Psicología
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In addition, as noted by Kotsopoulosa and Leeb (2012) , both the linguistic and the mathematical complexity of the problem have been related to the results achieved in problem-solving. ...
The problems are formulated to pose two main requirements: comprehension of the problem and selection of the adequate procedure to solve it. The total score ranges between 0 and 15 points. ...
doi:10.6018/analesps.31.1.158111
fatcat:ybanibslcreq3ktnhhtyerjb7a
On scale independence for querying big data
2014
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Intuitively, such queries require only a relatively small subset of the data, whose size is determined by the query and access methods rather than the size of the dataset itself. ...
Since the complexity turns out to be rather high, and since scale-independent queries cannot be captured syntactically, we develop sufficient conditions for scale independence. ...
We first deal with the problem QDSI in which both the query and the database are part of the input. We start with combined complexity. ...
doi:10.1145/2594538.2594551
dblp:conf/pods/FanGL14
fatcat:la44xlzu6fbstgxrhgnklr7fgq
Towards materialized view selection for distributed databases
2009
Proceedings of the 12th International Conference on Extending Database Technology Advances in Database Technology - EDBT '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our approach scales well: Within 15 minutes it chooses a set of MVs for a realworld scenario consisting of 1,000 relations, 400 hosts, and a workload of 3,000 queries and updates. ...
Such problems are typical for large enterprises, e.g., global retailers storing thousands of relations on hundreds of nodes at different subsidiaries. ...
selection problem for complex, distributed scenarios. ...
doi:10.1145/1516360.1516484
dblp:conf/edbt/ChavesBHB09
fatcat:t5to7kliwjdilb2frnue6n3fpe
A Clonal Selection Optimization System for Multiparty Secure Computing
2021
Complexity
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
The innovation of the deep learning modeling scheme plays an important role in promoting the research of complex problems handled with artificial intelligence in smart cities and the development of the ...
With the widespread use of smart interactive devices and systems, the exponential growth of data volume and the complex modeling requirements increase the difficulty of deep learning modeling, and the ...
for complex modeling problems and more maneuverable. ...
doi:10.1155/2021/7638394
fatcat:fvqactuv5ncp3chwavpswrzibq
Annotation propagation revisited for key preserving views
2006
Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
These are important for data provenance and the management of view updates. However important, these problems are unfortunately NP-hard for most subclasses of SPJ views [5] . ...
We show that group updates make the analysis harder: these problems become NP-hard for several subclasses of SPJ views. ...
Floris Geerts is a postdoctoral researcher of the FWO Vlaanderen and is supported in part by EPSRC GR/S63205/01. ...
doi:10.1145/1183614.1183705
dblp:conf/cikm/CongFG06
fatcat:oi5kcdzvabexzmthv35htu7zne
Improved Decoding Algorithms of LDPC Codes Based on Reliability Metrics of Variable Nodes
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
At the same time, the algorithm can force the related variable nodes to be updated, and make every edge have an equal opportunity of being updated. ...
INDEX TERMS Low-density parity-check (LDPC) codes, dynamic selection strategies, dynamic updating strategies, residuals of variable nodes. ...
In order to solve this problem, the most unreliable vicinal variable node related to each variable node in the proposed RM-RBP algorithm is selected through using the RM-I and the message residual of variable ...
doi:10.1109/access.2019.2904173
fatcat:e4pao2gh2nbpjijt7nr22rpfka
« Previous
Showing results 1 — 15 out of 937,294 results