Filters








2,099 Hits in 2.7 sec

Near-Optimal Distributed Band-Joins through Recursive Partitioning [article]

Rundong Li, Wolfgang Gatterbauer, Mirek Riedewald
2020 Proceedings of the ACM SIGMOD International Conference on Management of Data   pre-print
We consider running-time optimization for band-joins in a distributed system, e.g., the cloud. To balance load across worker machines, input has to be partitioned, which causes duplication.  ...  Our main insight is that recursive partitioning of the join-attribute space with the appropriate split scoring measure can achieve both low optimization cost and low join cost.  ...  Attribute-space partitioning is explored in other contexts for optimization goals that are very different from distributed band-join optimization.  ... 
doi:10.1145/3318464.3389750 pmid:33568887 pmcid:PMC7872589 arXiv:2004.06101v1 fatcat:4bick2aa2fadnlfuzgkybksbhe

An Octree-Based Approach towards Efficient Variational Range Data Fusion [article]

Wadim Kehl, Tobias Holl, Federico Tombari, Slobodan Ilic, Nassir Navab
2016 arXiv   pre-print
We explain how to dynamically adjust the optimizer's geometric structure via joining/splitting of Octree nodes and how to define the operators.  ...  The main challenge is to uphold speed and a low memory footprint without sacrificing the solutions' accuracy during optimization.  ...  In this work, we build our optimization around Octrees which recursively divide up the space into eight equally-sized cubes according to split and join rules.  ... 
arXiv:1608.07411v1 fatcat:cpm6hj5ycrecvfwaljaryncag4

Distributed Power and Channel Allocation for Cognitive Femtocell Network Using a Coalitional Game in Partition-Form Approach

Tuan LeAnh, Nguyen H. Tran, Sungwon Lee, Eui-Nam Huh, Zhu Han, Choong Seon Hong
2017 IEEE Transactions on Vehicular Technology  
After that, we formulate the optimization problem as a coalitional game in partition form, which obtains sub-optimal solutions.  ...  The distributed resource allocation problem is addressed via an optimization problem, in which we maximize the uplink sum-rate under constraints of intra-tier and inter-tier interferences while maintaining  ...  Then, in order to solve the optimization problem at each DJG, we formulate this optimization problem as a coalitional game in the partition form, which obtains near-optimal solutions along with efficient  ... 
doi:10.1109/tvt.2016.2536759 fatcat:o6ulqpvq7zckxahfpzxp2vnas4

A MULTIAGENT ARCHITECTURE FOR 3D RENDERING OPTIMIZATION

Carlos Gonzalez-Morcillo, Gerhard Weiss, David Vallejo, Luis Jimenez-Linares, Jose Jesus Castro-Schez
2010 Applied Artificial Intelligence  
Distributed Multiagent Optimizations The distributed approach is a good option to optimize the rendering process.  ...  Through this novel and pioneering approach we aim to reach three main goals: i) to reduce the time spent in the rendering of photorealistic images by means of a distributed approach, ii) to optimize critical  ... 
doi:10.1080/08839511003715212 fatcat:q66bj74hnbfs5hsrurhkfspxji

Optimised filters for texture defect detection

J.L. Sobral
2005 IEEE International Conference on Image Processing 2005  
Each filter is applied to one wavelet sub-band and its size and shape are tuned for a defect type.  ...  The wavelet transform provides a very efficient way to decompose a complex texture into a set of base components (wavelet sub-bands), which are then analysed by each filter to detect a kind of defect.  ...  The threshold limit is set to a value near of the first false positive. Figure 4 shows how the masks from this table are distributed in the wavelet sub-band decomposition.  ... 
doi:10.1109/icip.2005.1530454 dblp:conf/icip/Sobral05 fatcat:456go5gt5rh35bor7fl5vcegtm

Predictable performance for unpredictable workloads

P. Unterbrunner, G. Giannikis, G. Alonso, D. Fauser, D. Kossmann
2009 Proceedings of the VLDB Endowment  
Crescando uses main-memory storage and data partitioning to scale-up linearly on multi-core machines. 3.  ...  While the proposed approach is not always optimal for a given workload, it provides latency and freshness guarantees for all workloads.  ...  Index Union Join In the course of our work, we have experimented with a number of existing join algorithms, such as a partitioned sort-merge band join [8] for large range predicates.  ... 
doi:10.14778/1687627.1687707 fatcat:swad6x2kcbd4fhonrbitdjdqtu

A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data

Emily K. Szusz, Allan R. Willms
2010 SIAM Journal on Scientific Computing  
The algorithm yields an optimal or near optimal representation, subject to this constraint, in the L∞ norm and does so in at worst O(nK) time, where n is the number of data points and K the number of segments  ...  Instead, the data points tend to be clustered near the center of the band.  ...  In particular, data points were clustered near the outside edge of the band at places where the band changed slope.  ... 
doi:10.1137/090769077 fatcat:zsdmoa6gdzazhop65yhekfkeui

Query evaluation techniques for large databases

Goetz Graefe
1993 ACM Computing Surveys  
combination Partitioning Random write, sequential read Fan-out Write-behind Double-buffering, striping partitioning input Recursive partitioning Recursion depth Nonoptimal hash table  ...  Second, new bit vector filters can be cre- ated and used for each partition in each recursion level.  ... 
doi:10.1145/152610.152611 fatcat:auqfirimvjbsfo36s6guwgqc3a

Best-bases feature extraction algorithms for classification of hyperspectral data

S. Kumar, J. Ghosh, M.M. Crawford
2001 IEEE Transactions on Geoscience and Remote Sensing  
The top-down algorithm recursively partitions the bands into two (not necessarily equal) sets of bands and then replaces each final set of bands by its mean value.  ...  Due to advances in sensor technology, it is now possible to acquire hyperspectral data simultaneously in hundreds of bands.  ...  The proposed TD-GLDB algorithm has the following three stages: 1) Recursive partitioning of adjacent bands into nonoverlapping groups (subspaces): All the bands in the hyperspectral data set are recursively  ... 
doi:10.1109/36.934070 fatcat:7v5gcr7tl5fsvgzmdo2vmnzx6i

Collaboration Game Theory Heterogeneous Network Resource Allocation Algorithm

Jianfei Zhou, Na Liu
2016 International Journal of Future Generation Communication and Networking  
But the need to optimize collaboration between cells, select the number and scope of the coordinated cell.  ...  To solve this problem, we use collaborative tools of game theory, to be distributed among the power cells to determine the coverage of each pico cell.  ...  In the following, we will propose a distributed algorithm to find the optimized partition to make the coalition utility best. (2) The problem formulation Elements in the coalition set ℬ = {S 1 , … , S  ... 
doi:10.14257/ijfgcn.2016.9.8.09 fatcat:l2ro2sepqvhmzmceck5dqtlhba

HEALPix: A Framework for High‐Resolution Discretization and Fast Analysis of Data Distributed on the Sphere

K. M. Gorski, E. Hivon, A. J. Banday, B. D. Wandelt, F. K. Hansen, M. Reinecke, M. Bartelmann
2005 Astrophysical Journal  
Since the associated Legendre polynomials are evaluated via slow recursions, any sampling grid deviations from an iso-latitude distribution result in a prohibitive loss of computational performance with  ...  Equal areas of discrete elements of partition.  ... 
doi:10.1086/427976 fatcat:zhw54cqhzjaclhqqftgbushjbe

Designing and Mining Multi-Terabyte Astronomy Archives: The Sloan Digital Sky Survey [article]

Alexander S. Szalay, Peter Kunszt, Ani Thakar, Jim Gray
1999 arXiv   pre-print
Points in this space have highly correlated distributions. The archive will enable astronomers to explore the data interactively.  ...  The data will be partitioned in many ways. Small tag objects consisting of the most popular attributes speed up frequent searches.  ...  The Sloan Digital Sky Survey The Sloan Digital Sky Survey (SDSS) will digitally map about half of the Northern sky in five spectral bands from ultraviolet to the near infrared.  ... 
arXiv:cs/9907009v1 fatcat:wor6w277angadcr32jkx4iz2bm

Intelligent Similarity Joins for Big Data Integration

Mian Wang, Tiezheng Nie, Derong Shen, Yue Kou, Ge Yu
2013 2013 10th Web Information System and Application Conference  
Using data statistics, we convert predicates on a table into data induced predicates (diPs) that apply on the joining tables.  ...  We use diPs to skip data exclusively during query optimization; i.e., diPs lead to better plans and have no overhead during query execution.  ...  graphs; in today's cost-based optimizers, achieving such recursion and negrained query-wide ordering is challenging [ ]. us, we use the hybrid design discussed next.  ... 
doi:10.1109/wisa.2013.79 dblp:conf/IEEEwisa/WangNSKY13 fatcat:zpgecqejknhudaygsrergdqk7e

Designing and mining multi-terabyte astronomy archives

Alexander S. Szalay, Peter Z. Kunszt, Ani Thakar, Jim Gray, Don Slutz, Robert J. Brunner
2000 SIGMOD record  
Points in this space have highly correlated distributions. The archive will enable astronomers to explore the data interactively.  ...  The data will be partitioned in many ways. Small tag objects consisting of the most popular attributes will accelerate frequent searches.  ...  The hash machine is a simple form of the more general dataflow programming model in which data flows from storage through various processing steps. Each step is amenable to partition parallelism.  ... 
doi:10.1145/335191.335439 fatcat:rwt7cvzhafez5p4vqediiflc6q

Designing and mining multi-terabyte astronomy archives

Alexander S. Szalay, Peter Z. Kunszt, Ani Thakar, Jim Gray, Don Slutz, Robert J. Brunner
2000 Proceedings of the 2000 ACM SIGMOD international conference on Management of data - SIGMOD '00  
Points in this space have highly correlated distributions. The archive will enable astronomers to explore the data interactively.  ...  The data will be partitioned in many ways. Small tag objects consisting of the most popular attributes will accelerate frequent searches.  ...  The hash machine is a simple form of the more general dataflow programming model in which data flows from storage through various processing steps. Each step is amenable to partition parallelism.  ... 
doi:10.1145/342009.335439 dblp:conf/sigmod/SzalayGKT00 fatcat:zr4lvvnvsngghel6ljrddeujsy
« Previous Showing results 1 — 15 out of 2,099 results