Exploració per autor "Martínez Parra, Conrado"
Ara es mostren els items 21-40 de 47
-
LotterySampling: A randomized algorithm for the Heavy Hitters and Top-k problems in data streams
(Springer, 2022)
Capítol de llibre
Accés obertWe propose a new randomized count-based algorithm to solve the Heavy Hitters and Top-k problems in data streams. This algorithm, called LotterySampling, uses the intuitive concept of “lottery tickets”, to decide which ... -
Median and hybrid median K-dimensional trees
(Springer, 2022)
Article
Accés obertWe consider here two new variants of K-dimensional binary search trees (K-d trees): median K-d trees and hybrid-median K-d trees. These two kinds of trees are designed with the aim to get a tree as balanced as possible. ... -
New results about the list access problem
(1996-11-27)
Report de recerca
Accés obertWe consider the list access problem and show that two unrealistic assumptions in the original cost model presented in and subsequent literature allow for several competitiveness resulst of the move-to-front heuristic (MTF). ... -
On deletions in open addressing hashing
(2011)
Report de recerca
Accés obertDeletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark ’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting ... -
On deletions in open addressing hashing
(Society for Industrial and Applied Mathematics (SIAM), 2018)
Text en actes de congrés
Accés obertDeletions in open addressing tables have often been seen as problematic. The usual solution is to use a special mark’deleted’ so that probe sequences continue past deleted slots, as if there was an element still sitting ... -
On the average performance of fixed partial match queries in random relaxed K-d trees
(2014)
Text en actes de congrés
Accés restringit per política de l'editorialWe obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified ... -
On the average performance of orthogonal range search in multidimensional data structures
(2001-11)
Report de recerca
Accés obertIn this work we present the average-case analysis of orthogonal range search for several multidimensional data structures. We first consider random relaxed K-d trees as a prototypical example and later extend our results ... -
On the average size of the intersection of binary trees
(1989-01)
Report de recerca
Accés obertThe average-case analysis of algorithms for binary search trees yields very different results from those obtained under the uniform distribution. The analysis itself is more complex and replaces algebraic equations by ... -
On the competitiveness of the move-to-front rule
(1996-11)
Report de recerca
Accés obertWe consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (Amortized Efficiency of List Update and Paging Rules, CACM, 28(2):202-208, ... -
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 ... -
On the number of descendants and ascendants in random search trees
(1997-01)
Report de recerca
Accés obertWe consider here the probabilistic analysis of the number of descendants and the number of ascendants of a given internal node in a random search tree. The performance of several important algorithms on search trees is ... -
On the variance of quickselect
(2005-10)
Report de recerca
Accés obertQuickselect with median-of-three is routinely used as the method of choice for selection of the mth element out of n in general-purpose libraries such as the C++ Standard Template Library. Its average behavior is fairly ... -
Optimal and nearly optimal weighted skip lists
(1995-01-01)
Report de recerca
Accés obertWe consider the problem of building a static (i.e. no updates are performed) skip list of n elements, given these n elements and the corresponding access probabilities or weights. We develop a dynamic programming algorithm ... -
Optimal sampling strategies in quicksort and quickselect
(1998-01)
Report de recerca
Accés obertIt is well-known that the performance of quicksort may substantially be improved by selecting the median of a sample of three elements as the pivot of each partitioning stage. This variant makes more unlikely the ... -
Parallel update and search in skip lists
(1993-08)
Report de recerca
Accés obertWe present a PRAM implementation of a parallel dictionary with skip lists. More precisely, we give algorithms to search, insert and delete k ordered elements in a skip list of n elements in parallel. The algorithms are ... -
Partial match queries in quad-K-d trees
(Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022)
Text en actes de congrés
Accés obertQuad-K-d trees [Bereckzy et al., 2014] are a generalization of several well-known hierarchical Kdimensional data structures. They were introduced to provide a unified framework for the analysis of associative queries and ... -
Partial match queries in relaxed multidimensional search trees
(1998-10)
Report de recerca
Accés obertPartial match queries arise frequently in the context of large databases, where each record contains a distinct multidimensional key, that is, the key of each record is a K-tuple of values. The components of a key are ... -
Patterns in random binary search tree
(1996-10)
Report de recerca
Accés obertIn a randomly grown binary search tree (BST) of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a ... -
Prettyprint: a simple tool for typesetting algorithms
(1994-03-16)
Report de recerca
Accés obert
