• Publications
  • Influence
Choose the damping, choose the ranking?
The novel notions of strong rank and weak rank of a node provide a measure of the fuzziness of the rank of that node, of the objective orderability of a graph's nodes, and of the quality of results returned by different ranking algorithms based on the random surfer model.
Some Computational Complexity Results for Synchronous Context-Free Grammars
This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation, and reports two hardness results for the class NP, along with an exponential time lower-bound for certain classes of algorithms that are currently used in the Literature.
VirtualShave: Automated hair removal from digital dermatoscopic images
VirtualShave is a novel tool to remove hair from digital dermatoscopic images that is comparable to that of a human operator removing hair manually, and the resulting images are almost indistinguishable from those of hair-free skin.
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies
This paper formulates and investigates the question of whether a given algorithm can be coded in a way efficiently portable across machines with different hierarchical memory systems, modeled as a(x)-HRAMs (Hierarchical RAMs), and proposes the decomposition-tree memory manager and the reoccurrence-width memory manager.
A Dynamically Partitionable Compressed Cache
While compression is often researched in the context of a large stream, in this work it is applied repeatedly on smaller cache-line sized blocks so as to preserve the random access requirement of a cache.
psort, Yet Another Fast Stable Sorting Software
Ppsort's internals are detailed, and the careful fitting of its architecture to the structure of modern PCs-class platforms, allowing it to outperform state-of-the-art sorting software such as GNUsort or STXXL.
Deterministic oblivious distribution (and tight compaction) in linear time
  • E. Peserico
  • Mathematics, Computer Science
  • 18 July 2018
This work shows how to permute the elements in the array so that all marked elements end in marked positions, in time O(N) - i.e. with a sequence of memory accesses that depends only on N and not on which elements or positions are marked.
Sublinear Algorithms for Local Graph Centrality Estimation
These are the first algorithms yielding worst-case sublinear bounds for general directed graphs and any choice of the target node.
Choose the Damping, Choose the Ranking?
It is shown that rank is indeed relatively stable in both graphs, and that “classic” PageRank marginally outperforms Weighted In-degree, mainly due to its ability to ferret out “niche” items.
Sizing Up the Troll: A Quantitative Characterization of Moderator-Identified Trolling in an Online Forum
This work gives a quantitative analysis of posts, conversations, and users, specifically sanctioned for trolling in an online forum, to address the gap in knowledge of how trolls interact and provide cues of their malicious intent.