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
Merging Hierarchies Using Object Placement
2008
2008 IEEE 24th International Conference on Data Engineering
Preserved Fulltext
In this paper we instead use the placement of objects present in both hierarchies to infer how the hierarchies relate. ...
We present a second algorithm that uses the discovered facets to copy objects that only appear in the second hierarchy into the first one, to arrive at a more comprehensive hierarchy. ...
ACKNOWLEDGMENTS The authors would like to thank AnHai Doan of the University of Wisconsin for his useful comments on an earlier draft and for providing access to his data. ...
doi:10.1109/icde.2008.4497541
dblp:conf/icde/ZhaoIG08
fatcat:4an6tuschreyhpnxo4cut6hui4
VideoEdge: Processing Camera Streams using Hierarchical Clusters
2018
2018 IEEE/ACM Symposium on Edge Computing (SEC)
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 2019; you can also visit the original URL.
The file type is application/pdf.
Our objective is to select the "query plan" -implementations (and their knobs) -and place it across the hierarchy of clusters, and merge common components across queries to maximize the average query accuracy ...
, and merging. ...
MOTIVATING EXAMPLE In this section, we motivate the need for careful query planning, placement, and merging across a hierarchy of clusters using an illustrative example. ...
doi:10.1109/sec.2018.00016
dblp:conf/edge/HungABGYBP18
fatcat:4d4x3ydgizax3jckcv2o5xkmgm
GRAINS: Generative Recursive Autoencoders for INdoor Scenes
[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
, and their relative positioning with respect to other objects in the hierarchy. ...
Using a dataset of annotated scene hierarchies, we train a variational recursive autoencoder, or RvNN-VAE, which performs scene object grouping during its encoding phase and scene generation during decoding ...
Given a training hierarchy, we first encode each leaf-level object using BoxEnc. ...
arXiv:1807.09193v5
fatcat:ps23v5acxvhvndgluzqyf7shae
SCORES: Shape Composition with Recursive Substructure Priors
[article]
2018
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.
Our network takes as input sets of parts from two or more source 3D shapes and a rough initial placement of the parts. ...
Iterative optimization Objective. To merge a set B of part OBBs, we organize them into an optimal hierarchy H whose subtrees are well explained by a learned substructure model. ...
At a leaf node, only its outer, but not inner, code is used to decode an OBB. • No VQ-VAE. No substructure prior. • No Hierarchy Resampling. The initial hierarchy is used for all iterations. ...
arXiv:1809.05398v1
fatcat:wchwdrv6kjeironmqk6j2aadqy
Efficient cell-based migration of VLSI layout
2014
Optimization and 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 2015; you can also visit the original URL.
The file type is application/pdf.
We describe a hierarchy-driven computationally efficient algorithm for cell-based layout conversion, used by Intel in its Tick-Tock roadmap. ...
They are also thankful for the useful reviewers' comments, which helped improving the manuscript. ...
The vertices V are all the wire and border objects in L. We subsequently use the term vertex and object interchangeably. 2. ...
doi:10.1007/s11081-014-9257-7
fatcat:j5zmr6ri4na4tguwe2qf6olv7u
An Efficient Timing and Clock Tree Aware Placement Flow with Multibit Flip-Flops for Power Reduction
[chapter]
2017
Communications in Computer and Information 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 2019; you can also visit the original URL.
The file type is application/pdf.
The merging algorithm has to follow the hierarchical approach to target the FFs at the same hierarchy level. • With gated clocks widely used in the design for dynamic power reduction, the grouping of FFs ...
Tool efficiently fulfills the objective of minimized WL and placement density during the placement of logic cells. ...
doi:10.1007/978-981-10-7470-7_56
fatcat:fyvgrftno5fn7ggllygkvlqyiu
Text mapping: Visualising unstructured, structured, and time-based text collections
2008
International Journal of Intelligent Decision Technologies
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.
Projection is often achieved with a force-directed placement algorithm. ...
Where extra information about a text collection is available, such as a topical hierarchy or some chronological ordering, it can be used to improve a visualisation. ...
Fig. 4 . 4 Force-directed placement (FDP). Over many iterations, similar objects move closer together and dissimilar objects move further apart. ...
doi:10.3233/idt-2008-2204
fatcat:je5zlfn7nvdc7bz7rnenx4eqtm
PMU Optimal Placement in Wide Area Monitoring Systems using Grey Wolf Optimization technique
2019
Algerian journal of signals and 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 2021; you can also visit the original URL.
The file type is application/pdf.
The objective of this work is first, to find the optimal placement of a minimum number of PMUs in some standardized IEEE systems. Next, the same method was applied to the Algerian 63 bus system. ...
The simulations are carried out using MATLAB/SIMULINK. ...
The authors solved the problem of the right incident bus choice by proposing three rules to assure the right selection of the bus to be merged with the ZIB as well as the right PMU placement. ...
doi:10.51485/ajss.v4i1.76
fatcat:zmkd2egi65h7lia5qgxqqo6hyi
3D Scene Description and Recording Mechanism: A Comparative Study of Various 3D Create Tools
2020
Journal of system and management sciences
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.
The proposed technique is to classify 3D contents into asset, hierarchy, and script, and then reanalyze and mainly focused on the hierarchy and script transformation. ...
Hierarchy and scripts were to reduce as much as possible to minimize the confusion in the WEB 3D create tool form. ...
Creating asset and hierarchy structures. 7-1 asset -Merge data by bringing mesh data of step 6 and only folder location information of asset. 7-2 Hierarchy -Merging 6 levels of mesh data, 5 levels of light ...
doi:10.33168/jsms.2020.0107
fatcat:owtgsrhidrbt5jznqlchd4utb4
Approximating polyhedra with spheres for time-critical collision detection
1996
ACM Transactions on Graphics
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.
of objects. ...
In a sample application, hierarchies built this way allow the time-criticalcollision-detectionalgorithmto have acceptableaccuracy, improving significantly on that possible with hierarchies built by previous ...
COMPLETING THE HIERARCHIES Once the preprocess has used merging to build a sphere hierarchy that approximates a polyhedral object, two extra steps can give the hierarchy some useful properties. l P. ...
doi:10.1145/231731.231732
fatcat:cnoytaan4veo3lcx57pgis4bcq
Cell-based interconnect migration by hierarchical optimization
2014
Integration
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 2014; you can also visit the original URL.
The file type is application/pdf.
We describe an algorithm of a hierarchy-driven optimization method for cell-based layout conversion used at Intel for already several product generations. ...
Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. ...
Acknowledgments The authors are thankful for the useful reviewers' comments, which helped improving the manuscript. ...
doi:10.1016/j.vlsi.2013.10.003
fatcat:aixc57sbi5asvbjmmavl7p2egi
Adaptive indexing for relational keys
2010
2010 IEEE 26th International Conference on Data Engineering Workshops (ICDEW 2010)
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.
Adaptive merging for keys also enables further improvements in B-tree indexes. First, partitions can be matched to levels in the memory hierarchy such as a CPU cache and an in-memory buffer pool. ...
Adaptive merging for keys also enables further improvements in B-tree indexes. First, partitions can be matched to levels in the memory hierarchy such as a CPU cache and an in-memory buffer pool. ...
For adaptive merging using partitioned B-trees, one opportunity is to match partitions to levels in the memory hierarchy. ...
doi:10.1109/icdew.2010.5452743
dblp:conf/icde/GraefeK10
fatcat:sv5kfcsxh5bunleof4yckv44lm
Regular layout generation of logically optimized datapaths
1997
Proceedings of the 1997 international symposium on Physical design - ISPD '97
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 functional and structural analyses results are then merged yielding a regular preplacement for the logically optimized design. ...
After each customary iteration of placement, backannotation and logic optimization, functional correspondences between the optimized and the original netlists are identified by a logic correspondence extractor ...
in case a physical hierarchy is used, as is done by DPCs. ...
doi:10.1145/267665.267677
dblp:conf/ispd/NijssenE97
fatcat:iuclhzjk6ba43f4gkrue6tvrnm
The SNOMED RT Procedure Model
2001
Proceedings. AMIA Symposium
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.
While the objectives have largely been met, open issues continue to be addressed. ...
The similarity between procedure models of SNOMED RT and the U.K. s Clinical Terms Version 3 is proving to greatly facilitate the full integration of the two terminologies into a merged vocabulary to be ...
Laboratory LOINC concepts have been merged with SNOMED RT laboratory observations'112; as a result, SNOMED RT laboratory observations use a distinct set of roles that mirror those used by LOINC. ...
pmid:11825170
pmcid:PMC2243437
fatcat:nc6d47dgo5genhaxsrjtfp552a
Big data challenges in simulation-based science
2014
Proceedings of the sixth international workshop on Data intensive distributed computing - DIDC '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 2017; you can also visit the original URL.
The file type is application/pdf.
, accelerators) to support co-design
-Data placement, data movement and data processing
-Tradeoffs in combination resilience, quality of solution, and other objectives
Memory''''
''hierarchy' ...
(Top: full-resolution; Bottom: adaptive resolution) Amount of data transfer using static placement, adaptive placement and combined adaption (adaptive data resolution + adaptive placement)
Cross-Layer ...
doi:10.1145/2608020.2612731
dblp:conf/hpdc/Parashar14
fatcat:f4a4iueobjgfdhsq7mfytlhs3i
« Previous
Showing results 1 — 15 out of 19,058 results