Reports de recerca
Recent Submissions
-
Identifying bias in cluster quality metrics
(2021-12-12)
Research report
Open AccessWe study potential biases of popular cluster quality metrics, such as conductance or modularity. We propose a method that uses both stochastic and preferential attachment block models construction to generate networks with ... -
Bateria de afasias Western. Cuaderno de estímulos en castellano.
(2022-09)
Research report
Restricted access - publisher's policyQuadern d'estímuls de la bateria d'afàsies Western adaptat per a la llengua castellana. Pensat per a passar a pacients amb afàsia. Es pot aplicar per a controls monolingües en l'estudi en contextos bilingües. -
Healthy Twitter discussions? Time will tell
(2022-03-21)
Research report
Open AccessStudying misinformation and how to deal with unhealthy behaviours within online discussions has recently become an important field of research within social studies. With the rapid development of social media, and the ... -
Classification of a point with respect to a polyhedron vertex
(1990)
Research report
Open Access -
Approximating layout problems on geometric random graphs
(1998-10-13)
Research report
Open AccessWe show two simple algorithms that, with high probability, approximate within a constant several layout problems for geometric random graphs drawn from the Gn(r) model r_cv(log¿¿n/n¿ ) for any constant c = 6. The layout ... -
Synchronized parallel algorithms on RedBlack trees
(1997-12)
Research report
Open AccessWe present an approach for designing synchronized parallel algorithms to update RedBlack trees. The resulting algorithms update k keys with k processors on trees of size n in time O(log n + log k) which is very close to ... -
Approximating convex quadratic programming is P-complete
(1995)
Research report
Open AccessIn this paper we show that the problem of Approximating Convex Quadratic Programming is P-complete. We also consider two approximation problems related to it, Solution Approximation and Value Approximation and show both ... -
Strong law for the depth of circuits
(1996)
Research report
Open AccessThis paper studies uniformly distributed size n circuits (labelled acyclic graphs) consisting of binary gates and a constant number of inpurts. We show that their depth is asymptotically 2e ln n in probability. To this ... -
New results about the list access problem
(1996-11-27)
Research report
Open AccessWe 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). ... -
Efficient parallel algorithms for some tree layout problems
(1992)
Research report
Open AccessThe minimum cut and minimum sum linear arrangement problems usually occur in solving wiring problems and have a lot in common with job sequencing questions. Both problems are NP-complete for general graphs and P for trees. ... -
Graph layout problems
(1992)
Research report
Open AccessIn this paper we survey the recent results and open questions about some graph layout problems. -
A note on log space optimization
(1992-12-30)
Research report
Open AccessWe show that computing iterated multiplication of word matrices over {0,1}, using the operations maximum and concatenation, is complete for the class optL of log space optimization functions. The same problem for word ...
RSS 1.0