Exploració per tema "Quadtrees"
Ara es mostren els items 4-10 de 10
-
Efficient production binning using octree tessellation in the alternate measurements space
(2015)
Article
Accés obertBinning after volume production is a widely accepted technique to classify fabricated ICs into different clusters depending on different degrees of specification compliance. This allows the manufacturer to sell non optimal ... -
Indirect test of M-S circuits using multiple specification band guarding
(2016-09-01)
Article
Accés obertTesting analog and mixed-signal circuits is a costly task due to the required test time targets and high end technical resources. Indirect testing methods partially address these issues providing an efficient solution using ... -
M-S test based on specification validation using octrees in the measure space
(2013)
Text en actes de congrés
Accés restringit per política de l'editorialTesting M-S circuits is a difficult task demanding high amount of resources. To overcome these drawbacks, indirect testing methods have been adopted as an efficient solution to perform specification based tests using easy ... -
Multi-directional space tessellation to improve the decision boundary in indirect mixed-signal testing
(2017-02-20)
Article
Accés restringit per política de l'editorialOne of the most challenging aspects in nowadays microelectronics industry is production test and verification of mixed-signal circuits. In order to cope with some of the drawbacks encountered in this scenario, researchers ... -
Object representation by means of nonminimal division quadtrees and octrees
(1985-01)
Article
Accés restringit per política de l'editorialQuadtree representation of two-dimensional objects is performed with a tree that describes the recursive subdivision of the more complex parts of a picture until the desired resolution is reached. At the end, all the leaves ... -
On the cost of fixed partial match queries in K-d trees
(2016-08-01)
Article
Accés obertPartial match queries constitute the most basic type of associative queries in multidimensional data structures such as K-d trees or quadtrees. Given a query q=(q0,…,qK-1) where s of the coordinates are specified and K-s ... -
On the expected cost of partial match queries in random Quad-K-d trees
(Springer, 2024-03-04)
Article
Accés obertQuad-K-d trees introduced by Bereckzy et al. (In: Proceedings of the 11th Latin merican Theoretical Informatics Conference (LATIN). Lecture Notes in Computer Science, vol. 8392, pp. 743–754, 2014) are a generalization of ...