Filters








15,487 Hits in 4.6 sec

Query Complexity of Sampling and Small Geometric Partitions

NAVIN GOYAL, LUIS RADEMACHER, SANTOSH VEMPALA
2014 Combinatorics, probability & computing  
It is also related to other partitioning problems in combinatorics and complexity theory.  ...  We conjecture an asymptotically optimal partition for DPP and show that it is optimal in two cases: when the dimension is low (k=n= 2) and when the factors of the parts are structured, namely factors of  ...  We also thank an anonymous reviewer for careful reading and useful comments. Appendix: From sampling lower bound to the continuous partitioning problem  ... 
doi:10.1017/s0963548314000704 fatcat:z3jvv7gxmbegrbhxpbcu46m77i

High performance spatial queries for spatial big data

Fusheng Wang, Ablimit Aji, Hoang Vo
2015 SIGSPATIAL Special  
There are two major challenges for managing massive spatial data to support spatial queries: the explosion of spatial data, and the high computational complexity of spatial queries.  ...  Hadoop-GIS supports multiple types of spatial queries on MapReduce through skew-aware spatial partitioning, on-demand indexing, customizable spatial query engine RESQUE, implicit parallel spatial query  ...  Acknowledgments This work is supported in part by NSF IIS 1350885, by NSF ACI 1443054, by NLM R01LM009239, and by NCI 1U24CA180924-01A1.  ... 
doi:10.1145/2766196.2766199 fatcat:esmpfrnt6bc35pqcmh2g66jfdm

iSPEED

Hoang Vo, Yanhui Liang, Jun Kong, Fusheng Wang
2018 Proceedings of the VLDB Endowment  
However, the exponential increase of available 3D data and the complex structures of biological objects make it extremely difficult to support spatial queries due to high I/O, communication and computational  ...  During query processing, the memory footprint of iSPEED is minimal due to its indexing structure and progressive decompression on-demand.  ...  ACKNOWLEDGEMENTS The research is supported in part by grants from National Science Foundation ACI 1443054 and IIS 1350885, National Institute of Health K25CA181503, and the Emory University Research Committee  ... 
doi:10.14778/3229863.3236264 pmid:31049259 pmcid:PMC6489122 fatcat:r6i4ucv4wjhdnp6dp6udyspaki

Minimum Search-time Algorithm for Image Retrieval in Cloud Computing

Abubakar Othman, Abubakar Tafawa Balewa University Bauchi
2021 International Journal of Intelligent Engineering and Systems  
We improved the minimum search time by the use of balance partitioning algorithm for the even distribution of data points into hash buckets to minimise search time, and similarity preserving algorithm  ...  Many hashing algorithms have been designed to improve retrieval accuracy and storage requirements of data in a large-scale database through long code word which increases the time complexity in loading  ...  In addition, high search time is incurred due to the time complexity involve in loading queries into memory. The time complexity slow the speed of data retrieval.  ... 
doi:10.22266/ijies2021.1031.52 fatcat:x4jwprat65ajzaznp5aaehjfaa

Efficient Algorithms for Learning from Coarse Labels [article]

Dimitris Fotakis, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos
2021 arXiv   pre-print
Instead of observing the actual labels from a set 𝒵, we observe coarse labels corresponding to a partition of 𝒵 (or a mixture of partitions).  ...  In this work, we formalize these settings and study the problem of learning from such coarse data.  ...  Acknowledgments We thank the anonymous reviewers for useful remarks and comments on the presentation of our manuscript. Dimitris  ... 
arXiv:2108.09805v1 fatcat:ngzbs44arjc4tf7iexox32igz4

Noise-Tolerant Parallel Learning of Geometric Concepts

Nader H. Bshouty, Sally A. Goldman, H.David Mathias
1998 Information and Computation  
Next we define a complexity measure of any set S of (d&1)-dimensional surfaces that we call the variant of S and prove that the class of geometric concepts defined by surfaces of polynomial variant can  ...  Next, we give an efficient noise-tolerant parallel algorithm to PAC-learn the class of geometric concepts defined by a polynomial number of (d&1)-dimensional hyperplanes (of unrestricted slopes) against  ...  The sample complexity and number of processors are poly(r, s, 1Â=, log 1Â$) and the parallel time complexity is poly(log r, log s, log 1Â=, log log 1Â$).  ... 
doi:10.1006/inco.1998.2737 fatcat:vp4f6ufyizbyhh4oukdpwudfqa

Label Efficient Learning by Exploiting Multi-Class Output Codes

Maria Balcan, Travis Dick, Yishay Mansour
2017 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We provide results for the commonly studied cases of one-vs-all learning and when the codewords of the classes are well separated.  ...  Rather than studying the behavior of these techniques for supervised learning, we establish a connection between the success of these methods and the existence of label-efficient learning procedures.  ...  Nevertheless, we show that the implicit geometric structure implied by the output code can be exploited to learn using a small number of label queries.  ... 
doi:10.1609/aaai.v31i1.10907 fatcat:vtamg54ubngfrhvlilypk4zjli

Far voxels

Enrico Gobbetti, Fabio Marton
2005 ACM SIGGRAPH 2005 Papers on - SIGGRAPH '05  
hardware occlusion queries for culling occluded subtrees, and asynchronous I/O for detecting and avoiding data access latencies.  ...  once (1.2G triangles approximated with 4.0M voxels and 595K triangles) Figure 1 : View-dependent rendering of extremely complex models.  ...  The source 3D datasets are provided by and used with permission of the Boeing Company, the Digital Michelangelo project, and the Lawrence Livermore National Laborarories.  ... 
doi:10.1145/1186822.1073277 fatcat:fbzic5ydfjgutlu7csvkcs7xxa

Far voxels

Enrico Gobbetti, Fabio Marton
2005 ACM Transactions on Graphics  
hardware occlusion queries for culling occluded subtrees, and asynchronous I/O for detecting and avoiding data access latencies.  ...  once (1.2G triangles approximated with 4.0M voxels and 595K triangles) Figure 1 : View-dependent rendering of extremely complex models.  ...  The source 3D datasets are provided by and used with permission of the Boeing Company, the Digital Michelangelo project, and the Lawrence Livermore National Laborarories.  ... 
doi:10.1145/1073204.1073277 fatcat:7mahgiqe5zbyhafyhykwar55rm

Property Testing with Geometric Queries [chapter]

Artur Czumaj, Christian Sohler
2001 Lecture Notes in Computer Science  
We shall discuss a number of models that in our opinion fit best geometric problems and apply them to study geometric properties for three very fundamental and representative problems in the area: testing  ...  Comparing to the previous work in property testing, there are two novel aspects developed in this paper: geometric measures of being close to an object having the predetermined property, and the use of  ...  It works for the Neighborhood measure, and it shows that the use of geometric queries (orthogonal range queries) allows to beat the lower bounds discussed in Section 2.2 and obtain the query complexity  ... 
doi:10.1007/3-540-44676-1_22 fatcat:aiq22mqiafak7frjykwwveq7iy

Approximate Top-k Queries in Sensor Networks [chapter]

Boaz Patt-Shamir, Allon Shafrir
2006 Lecture Notes in Computer Science  
In contrast to previous algorithms, the communication complexity depends only on the global scores and not on the partition of scores among nodes.  ...  A top-k query in such a system asks which are the k items whose sum of counts, across all nodes in the system, is the largest.  ...  It turns out that the following quantity has a central role in the complexity of computing top-k (and approximate top-k) queries.  ... 
doi:10.1007/11780823_25 fatcat:ra53l5jnybfcnmawyfyok7adby

Differential Private Spatial Decomposition and Location Publishing Based on Unbalanced Quadtree Partition Algorithm

Yan Yan, xin Gao, Adnan Mahmood, Tao Feng, Pengshou Xie
2020 IEEE Access  
Centralized publishing of big location data provides great convenience for various location-based interactive queries and services.  ...  publishing errors, the spatial partition structure, and privacy budget allocation.  ...  In the worst case scenario, for a big dataset with a total number of n samples and h partition depth, the time complexity of the above partition algorithms are all approximately O(hn). VI.  ... 
doi:10.1109/access.2020.2999580 fatcat:bac4wewh6jcxdih6rkflt2md44

The framework for approximate queries on simulation data

B. Lee, T. Critchlow, G. Abdulla, C. Baldwin, R. Kamimura, R. Musick, R. Snapp, N. Tang
2003 Information Sciences  
AQSim is a system intended to enable scientists to query and analyze a large volume of scientific simulation data.  ...  To be able to deal with the data interactively, AQSim allows the scientist to make an informed tradeoff between query response accuracy and time.  ...  For UVM authors, this research was partially supported by University of Vermont UCRS Faculty Research grant no. PSCI00-1 and the US Department of Energy through grant no. DE-FG02-ER45962.  ... 
doi:10.1016/s0020-0255(03)00185-3 fatcat:4dkxchec6vfedpwn7ru6yzm4ti

Simba

Dong Xie, Feifei Li, Bin Yao, Gefei Li, Liang Zhou, Minyi Guo
2016 Proceedings of the 2016 International Conference on Management of Data - SIGMOD '16  
Simba is based on Spark and runs over a cluster of commodity machines.  ...  It introduces indexes over RDDs in order to work with big spatial data and complex spatial operations.  ...  Simba resolves this challenge using a sampling based approach, i.e., a small set of samples (using sampling without replacement) is taken to build estimators for estimating the size of different partitions  ... 
doi:10.1145/2882903.2915237 dblp:conf/sigmod/XieL0LZG16 fatcat:kkus3fprcjevle5qxw7zaw2wtq

Noise-tolerant parallel learning of geometric concepts

Nader H. Bshouty, Sally A. Goldman, H. David Mathias
1995 Proceedings of the eighth annual conference on Computational learning theory - COLT '95  
Next we define a complexity measure of any set S of (d&1)-dimensional surfaces that we call the variant of S and prove that the class of geometric concepts defined by surfaces of polynomial variant can  ...  Next, we give an efficient noise-tolerant parallel algorithm to PAC-learn the class of geometric concepts defined by a polynomial number of (d&1)-dimensional hyperplanes (of unrestricted slopes) against  ...  The sample complexity and number of processors are poly(r, s, 1Â=, log 1Â$) and the parallel time complexity is poly(log r, log s, log 1Â=, log log 1Â$).  ... 
doi:10.1145/225298.225340 dblp:conf/colt/BshoutyGM95 fatcat:7mcvfvudubecppyafjfrqvdsre
« Previous Showing results 1 — 15 out of 15,487 results