A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Filters
Querying Objects Modeled by Arbitrary Probability Distributions
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
Therefore, recent solutions propose to model data objects by probability density functions(pdf). ...
In this paper, we introduce a method for efficiently indexing and querying GMMs allowing fast object retrieval for arbitrary shaped pdf. ...
In this paper, we approximate arbitrary probability distributions that are approximated by GMMs. ...
doi:10.1007/978-3-540-73540-3_17
fatcat:ybgfona2evc4fludmhyghxhura
Cost Models for Nearest Neighbor Query Processing over Existentially Uncertain Spatial Data
[chapter]
2013
Lecture Notes in Computer Science
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.
One type of uncertainty in spatial objects may come from their existence, which is expressed by a probability accompanying the spatial value of an object reflecting the confidence of the object's existence ...
In this paper, we present exact and approximate statistical methodologies for supporting cost models for Probabilistic Thresholding NN (PTNN) queries that deal with arbitrarily distributed data points ...
An effective cost model for PTNN and PRNN queries In this section we present an effective cost model for PTNN queries that works over arbitrary distributed spatial data with existential uncertainty. ...
doi:10.1007/978-3-642-40235-7_23
fatcat:qpmaqgmsgfaa7ezirgzspfdibq
Cost Models and Efficient Algorithms on Existentially Uncertain Spatial Data
2008
2008 Panhellenic Conference on Informatics
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 domain of existentially uncertain spatial data refers to objects that are modelled using an existential probability accompanying spatial data values. ...
An interesting and challenging query type over existentially uncertain data is the search of the Nearest Neighbor (NN), since the probability of a potential dataset object to be the NN of the query object ...
Acknowledgements Research supported by the Diachoron project, funded by the Greek Ministry of Development, General Secr. for Research and Technology, co-funded by EU. ...
doi:10.1109/pci.2008.36
dblp:conf/pci/FrentzosPT08
fatcat:4ssst5d2qnejtcdiezmwoi32bu
Training and Inference on Any-Order Autoregressive Models the Right Way
[article]
2022
arXiv
pre-print
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 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
First, we show that AO-ARMs suffer from redundancy in their probabilistic model, i.e., they define the same distribution in multiple different ways. ...
We alleviate this redundancy by training on a smaller set of univariate conditionals that still maintains support for efficient arbitrary conditional inference. ...
This research was supported by NSF(#1651565), AFOSR (FA9550-19-1-0024), ARO (W911NF-21-1-0125), ONR, DOE, CZ Biohub, and Sloan Fellowship. ...
arXiv:2205.13554v2
fatcat:mdk654pzazfnnpbsqamhmb4ocm
Towards an analysis of range query performance in spatial data structures
1993
Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '93
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 2003; you can also visit the original URL.
The file type is application/pdf.
In model 2, the window measure is retained but center distribution equals the object distribution: WQM2 = (1: l, A,cA, FG). ...
Model 4 is similar to model 3 except for the window
center distribution
Fe which equals the object distribu-
tion FG:
The four query models presented
above provide
a
framework
for the following ...
doi:10.1145/153850.153878
dblp:conf/pods/PagelSTW93
fatcat:le2hmxv2qnayvhzwwlwdw5sba4
Case Study: Scoop for Partial Read from P2P Database
[chapter]
2009
Handbook of Peer-to-Peer Networking
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 2009; you can also visit the original URL.
The file type is application/pdf.
We model the epidemic dissemination as a percolation problem and by rigorous percolation analysis tune Scoop per-query and on-the-fly to answer βqueries correctly and efficiently. ...
We prove the correctness of Scoop by theoretical analysis, and verify the efficiency of Scoop in terms of query cost and query time via extensive simulation. ...
Acknowledgments This research has been funded in part by NSF grants IIS-0238560 (PECASE), IIS-0534761, IIS-0742811 and CNS-0831505 (CyberTrust), and in part from the ME-TRANS Transportation Center, under ...
doi:10.1007/978-0-387-09751-0_21
fatcat:3hkn2ut7l5gfrorscgahz4li4a
APLA: Indexing Arbitrary Probability Distributions
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.
These observations are often inexact to begin with, and even if they are exact, a set of observations of an attribute of an object is better represented by a probability distribution than by a single number ...
Finally, we propose a new definition of k-NN queries on uncertain data. The new definition allows APLA and the APLA-tree to answer k-NN queries quickly, even on arbitrary probability distributions. ...
The LB dataset was provided by Yufei Tao [18] . This work was supported in part by grants no. ITR-0331697 and EIA-0080134 from the National Science Foundation. ...
doi:10.1109/icde.2007.367940
dblp:conf/icde/LjosaS07
fatcat:2jp3ta334vh27fbw562sk7wwme
Dynamic Guaranteed Cost Compression for Time Series Big Data
2015
International Journal of Database Theory and Application
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.
over probability relation components, and (iv) physical implementation solution of query for uncertain big data. ...
QPPUBG mainly includes four modules: (i) query equivalence reconstructing for uncertain big data; (ii) multiple query optimization over probability relation components; (iii) query execution plan constructing ...
Acknowledgments This work was supported in part by a grant from the National Natural Science Foundation of China (No. 61272268), the Program for New Century Excellent Talents in University (NCET-12-0413 ...
doi:10.14257/ijdta.2015.8.4.12
fatcat:xzbqawr2drgljpnsresnryclty
Partial read from peer-to-peer databases
2008
Computer Communications
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 2008; you can also visit the original URL.
The file type is application/pdf.
We model the epidemic dissemination as a percolation problem and by rigorous percolation analysis tune Scoop per-query and on-the-fly to answer β-queries correctly and efficiently. ...
We prove the correctness of Scoop by theoretical analysis, and verify the efficiency of Scoop in terms of query cost and query time via extensive simulation. ...
Acknowledgments This research has been funded in part by NSF grants EEC-9529152 (IMSC ERC), IIS-0238560 (PECASE), and unrestricted cash gifts from Microsoft and Google. ...
doi:10.1016/j.comcom.2007.08.013
fatcat:ugjj65wd6ngg7h6a2hdf26aylq
Segmental Semi-Markov Model Based Online Series Pattern Detection Under Arbitrary Time Scaling
[chapter]
2006
Lecture Notes in Computer Science
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 2016; you can also visit the original URL.
The file type is application/pdf.
However, it can only detect the matching sequences with approximately equal length to that of the query pattern. ...
Therefore, model based methods are proposed. Recently, the segmental semi-Markov model is introduced into the field of online series pattern detection. ...
The observations of every state can have an explicit distribution to model the dependence among them. | | P D = Number of objects that do not require full SWM
Improved Segmental Semi-Markov Model
Model ...
doi:10.1007/11811305_80
fatcat:uaedsf6kuzgirdrj36qk7d4fzq
A Model of Optimal Network Structure for Decentralized Nearest Neighbor Search
[article]
2017
arXiv
pre-print
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.
Networks, which structure allows efficient performing the nearest neighbour search by a decentralised search procedure started from any node, are of particular interest especially for pure distributed ...
In this case the search of the closest object can be thought as a search of a node in a network. ...
Acknowledgments This research is conducted in LATNA Laboratory, National Research University Higher School of Economics and supported by RSF grant 14-41-00039.
5 ...
arXiv:1712.08437v1
fatcat:rmwylftoqrdaxhuczskmqd46vy
PR2 looking at things — Ensemble learning for unstructured information processing with Markov logic networks
2014
2014 IEEE International Conference on Robotics and Automation (ICRA)
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 2016; you can also visit the original URL.
The file type is application/pdf.
In this setting Q and E are part of a probabilistic model of scenes, objects and their annotations, which the perception method has beforehand learned a joint probability distribution of. ...
We investigate the perception and reasoning task of answering queries about realistic scenes with objects of daily use perceived by a robot. ...
ACKNOWLEDGEMENT This work is supported in part by the EU FP7 projects RoboHow (grant number 288533) and ACAT(grant number 600578). ...
doi:10.1109/icra.2014.6907427
dblp:conf/icra/NygaBB14
fatcat:737ahdhpwjastpkbdaskbjrab4
Exploration of monte-carlo based probabilistic query processing in uncertain graphs
2012
Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM '12
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.
Since the problem of exact probability computation according to possible world semantics is in #P -Time for many combinations of model and query, and since ignoring uncertainty (e.g. by using expectations ...
The framework supports the most common uncertainty model for uncertain graphs, i.e. existential uncertainty for the edges of the graph. ...
Since queries in probabilistic graphs are inherently uncertain, the user receives probability distributions over possible results or probabilities of objects being part of the result. ...
doi:10.1145/2396761.2398742
dblp:conf/cikm/EmrichKNRSZ12
fatcat:ia3w2eatgfgsfkwwtwi3whpqg4
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
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.
In this paper, we study the problem of answering probabilistic range queries on moving objects based on an uncertainty model, which captures the possible movements of objects with probabilities. ...
By querying the index, we quickly eliminate unqualified objects and employ an approximate approach to examine the remaining candidates for final answer. ...
Even though not all moving objects' velocity distributions fit well, most objects can be approximated by a normal distribution. ...
doi:10.1145/1516360.1516369
dblp:conf/edbt/ChungLC09
fatcat:wrijnx72drg65lain3kh5mblnu
Approximate Query Processing using Deep Generative Models
[article]
2019
arXiv
pre-print
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.
Other Versions
We use deep generative models, an unsupervised learning based approach, to learn the data distribution faithfully such that aggregate queries could be answered approximately by generating samples from ...
The model is often compact - few hundred KBs - so that arbitrary AQP queries could be answered on the client side without contacting the database server. ...
The leaf nodes define the probability distributions for an individual variable. MSPN could be used to represent an arbitrary probability distribution [36] . ...
arXiv:1903.10000v3
fatcat:g3zjzhwpxvcohgzwueywszwtgi
« Previous
Showing results 1 — 15 out of 68,674 results