Filters








10,604 Hits in 3.2 sec

Online Uniformly Inserting Points on Grid [chapter]

Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin
2010 Lecture Notes in Computer Science  
In this paper, we give an insertion strategy with the maximal gap ratio no more than 2 √ 2 ≈ 2.828, which is the first result on uniformly inserting point on grid.  ...  We consider an online version of this problem, i.e., the points are inserted one at a time. The objective is to assign the points as uniform as possible.  ...  For the problem of uniformly inserting points, this is the first result on inserting points at grid position.  ... 
doi:10.1007/978-3-642-14355-7_29 fatcat:whdqxfq3zneutni4x4jkw5zkiu

Online Uniformly Inserting Points on the Sphere

Rong Zhou, Chun Chen, Liqun Sun, Francis Lau, Sheung-Hung Poon, Yong Zhang
2018 Algorithms  
The requests for point insertion arrive one by one and the target is to insert points as uniformly as possible.  ...  Uniformly inserting points on the sphere has been found useful in many scientific and engineering fields.  ...  Different from the offline version, the online version of this problem considers the situation of point insertion requests arriving one by one.  ... 
doi:10.3390/a11100156 fatcat:dah3iubkdzfnhpcc4r7hdlumji

Beacon Deployment for Sensor Network Localization

Rui Huang, Gergely V. Zaruba
2007 2007 IEEE Wireless Communications and Networking Conference  
We then provide an approximation algorithm with a logarithmic approximation ratio based on a set cover greedy heuristic; we study both offline and online versions of this approximation.  ...  Localizing each sensor node is becoming increasingly important as more and more algorithms and protocols in the disciplines of routing, energy management, and security have been proposed that rely on (  ...  Evidently, there is more than one grid point that covers both, but we simply choose one of them.  ... 
doi:10.1109/wcnc.2007.588 dblp:conf/wcnc/HuangZ07a fatcat:yzgpamzzhnd4hm7zbwlfmqaqmm

A leaf vein-like hierarchical silver grids transparent electrode towards high-performance flexible electrochromic smart windows

Teng Li, Shengyou Li, Xuyi Li, Zijie Xu, Jizhong Zhao, Yating Shi, Yanan Wang, Rui Yu, Xiangyang Liu, Qingchi Xu, Wenxi Guo
2019 Science Bulletin  
The selfformed branched grids made the conducting paths distributing uniformly while the laser-etching trunk grids enabled to transport the collected electrons across long-distance.  ...  In this work, we fabricated a large-area flexible TCE based on leaf vein-like hierarchical metal grids (HMG) comprising of mesoscale "trunk" and microscale "branches".  ...  Fig. 2d displays the WO 3 compact layer was uniformly pre-sputtered on the PET substrate to enhance the adhesion [34] .  ... 
doi:10.1016/j.scib.2019.11.028 fatcat:43nvkx53ije6nlpz7i5c7b6t2e

A Hierarchical RBF Online Learning Algorithm for Real-Time 3-D Scanner

S. Ferrari, F. Bellocchio, V. Piuri, N.A. Borghese
2010 IEEE Transactions on Neural Networks  
In this paper, a novel real-time online network model is presented.  ...  It is derived from the hierarchical radial basis function (HRBF) model and it grows by automatically adding units at smaller scales, where the surface details are located, while data points are being collected  ...  The best results are obtained when the points are sampled mostly uniformly in the first few layers.  ... 
doi:10.1109/tnn.2009.2036438 pmid:20007028 fatcat:7dzc3tktrffmde5vfk5egogonm

Real-time 3D reconstruction at scale using voxel hashing

Matthias Nießner, Michael Zollhöfer, Shahram Izadi, Marc Stamminger
2013 ACM Transactions on Graphics  
We contribute an online system for large and fine scale volumetric reconstruction based on a memory and speed efficient data structure.  ...  Our system uses a simple spatial hashing scheme that compresses space, and allows for real-time access and updates of implicit surface data, without the need for a regular or hierarchical grid data structure  ...  Top: moving volumes based on regular grids.  ... 
doi:10.1145/2508363.2508374 fatcat:ztnrgndtancr3nvzxoqti5ayf4

ST2B-tree

Su Chen, Beng Chin Ooi, Kian-Lee Tan, Mario A. Nascimento
2008 Proceedings of the 2008 ACM SIGMOD international conference on Management of data - SIGMOD '08  
Frequent updates to its subtrees allows rebuilding (tuning) a subtree using a different set of reference points and different grid size without significant overhead.  ...  We also present an online tuning framework for the ST 2 B-tree, where the tuning is conducted online and automatically without human intervention, also not interfering with regular functions of the MOD  ...  Based on the statistics in the Histogram, the Online Tuning module discovers new reference points and determines their grid granularity respectively.  ... 
doi:10.1145/1376616.1376622 dblp:conf/sigmod/ChenOTN08 fatcat:c2tkbcscrraqng42djwagnz2we

Continuous online index tuning in moving object databases

Su Chen, Mario A. Nascimento, Beng Chin Ooi, Kian-Lee Tan
2010 ACM Transactions on Database Systems  
., the set of reference points and grid granularity) based on the most recent data and workload. To cut down the overhead of rebuilding, we propose an eager update technique to construct the subtree.  ...  Based on the density, objects in a region are managed using a grid of appropriate granularity -intuitively, a dense region employs a grid with fine granularity, while a sparse region uses a grid with coarse  ...  Since the objects are uniformly distributed, the region-growing algorithm will result in only one reference point and hence the ST 2 B-tree degenerates to a B x -tree with only one reference point.  ... 
doi:10.1145/1806907.1806909 fatcat:j7tk4oouubeojcuue2kg2nkhzu

Streamed Graph Drawing and the File Maintenance Problem [article]

Michael T. Goodrich, Paweł Pszona
2013 arXiv   pre-print
Extending Algorithm 3 to placing nodes on a grid is straightforward. Instead of a circle, we operate on a set of grid points in convex position that are approximately circular.  ...  By definition, it can contain at most A grid points (at most one for each y-coordinate; distance of r from L is ≤ A).  ... 
arXiv:1308.6711v1 fatcat:z6xxdr7a7ndshcej4bq2ibc7ga

Generalized fundamental measure theory for atomistic modeling of macromolecular crowding

Sanbo Qin, Huan-Xiang Zhou
2010 Physical Review E  
Overall the GFMT gained a speed up of ϳ10 2 to 10 3 -fold over the insertion procedure. vided by the radius of gyration, r g , of points uniformly distributed on the surface.  ...  Because the r i and hence ⌬s i values are not uniform, the sample points are not uniformly distributed on the crowderexclusion surface.  ... 
doi:10.1103/physreve.81.031919 pmid:20365782 pmcid:PMC3537823 fatcat:pxocrlzi4bh6nfkdqcnyjtf55u

Discrete wave equation upscaling

Andreas Fichtner, Shravan M. Hanasoge
2017 Geophysical Journal International  
S U M M A R Y We present homogenization technique for the uniformly discretized wave equation, based on the derivation of an effective equation for the low-wavenumber component of the solution.  ...  on the medium properties.  ...  The peak frequency f peak and the minimum number of grid points per wavelength (g.p.p.w.) are on the horizontal axes. (Colour version available online.)  ... 
doi:10.1093/gji/ggx016 fatcat:fae3yshgjfgmrogyormau3yoea

A framework for estimating complex probability density structures in data streams

Arnold P. Boedihardjo, Chang-Tien Lu, Feng Chen
2008 Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08  
The maintenance time of an online KDE is defined as the total amount of time required to insert and process a given set of data points.  ...  Grid-based KDE -provides a uniform and discretized representation of the kernel points 2. Sample-based KDE -employs a sampling methodology on the data stream to reduce the total kernel size 3.  ... 
doi:10.1145/1458082.1458164 dblp:conf/cikm/BoedihardjoLC08 fatcat:xmvir2a4kfcshiljhgulczn3gy

A Randomized Algorithm for Online Unit Clustering [chapter]

Timothy M. Chan, Hamid Zarrabi-Zadeh
2007 Lecture Notes in Computer Science  
In the onedimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm.  ...  In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used.  ...  The adversary provides a sequence of 3 points at position 1, x, and 1 + x, where x is uniformly distributed in [0, 1].  ... 
doi:10.1007/11970125_10 fatcat:l7myjvfuafbnfip57zofnzebcy

A Randomized Algorithm for Online Unit Clustering

Timothy M. Chan, Hamid Zarrabi-Zadeh
2007 Theory of Computing Systems  
In the onedimensional case, we show that surprisingly the naïve upper bound of 2 on the competitive ratio can be beaten: we present a new randomized 15/8-competitive online algorithm.  ...  In this paper, we consider the online version of the following problem: partition a set of input points into subsets, each enclosable by a unit ball, so as to minimize the number of subsets used.  ...  The adversary provides a sequence of 3 points at position 1, x, and 1 + x, where x is uniformly distributed in [0, 1].  ... 
doi:10.1007/s00224-007-9085-7 fatcat:zw4zwi4i4vd5bk4wxck75by6vu

Streamed Graph Drawing and the File Maintenance Problem [chapter]

Michael T. Goodrich, Paweł Pszona
2013 Lecture Notes in Computer Science  
Extending Algorithm 3 to placing nodes on a grid is straightforward. Instead of a circle, we operate on a set of grid points in convex position that are approximately circular.  ...  When such an algorithm would move vertex v, we first check if there is an unused grid point between new neighbors of v on the circle. If so, we simply move the vertex to that point.  ... 
doi:10.1007/978-3-319-03841-4_23 fatcat:uav4dmb5ofh55n2ctbu673sr2e
« Previous Showing results 1 — 15 out of 10,604 results