#### Filter Results:

- Full text PDF available (23)

#### Publication Year

2001

2017

- This year (3)
- Last 5 years (19)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Giorgio Satta, Enoch Peserico
- HLT/EMNLP
- 2005

This paper investigates some computational problems associated with probabilistic translation models that have recently been adopted in the literature on machine translation. These models can be viewed as pairs of probabilistic contextfree grammars working in a ‘synchronous’ way. Two hardness results for the class NP are reported, along with an exponential… (More)

- Gianfranco Bilardi, Enoch Peserico
- ICALP
- 2001

- Alberto Silletti, Enoch Peserico, Alessandra Mantovan, Edoardo Zattra, Andrea Peserico, Anna Belloni Fortina
- Conference proceedings : ... Annual International…
- 2009

In a double blind evaluation of 60 digital dermatoscopic images by 4 "junior", 4 "senior" and 4 "expert" dermatologists (dermatoscopy training respectively less than 1 year, between 1 and 5 years, and more than 5 years), a significant inter-operator variability was observed in melanocytic lesion border identification (with a disagreement of the order of 10… (More)

- Enoch Peserico
- ArXiv
- 2013

We study a generalization of the classic paging problem that allows the amount of available memory to vary over time – capturing a fundamental property of many modern computing realities, from cloud computing to multi-core and energy-optimized processors. It turns out that good performance in the “classic” case provides no performance guarantees when memory… (More)

- Marco Bressan, Enoch Peserico
- J. Discrete Algorithms
- 2009

To what extent can changes in PageRank’s damping factor affect node ranking? We prove that, at least on some graphs, the top k nodes assume all possible k! orderings as the damping factor varies, even if it varies within an arbitrarily small interval (e.g. [0.84999 , 0.85001]). Thus, the rank of a node for a given (finite set of discrete) damping factor(s)… (More)

- David Chen, Enoch Peserico
- 2002

The effective size of an L2 cache can be increased by using a dictionary-based compression scheme. Naive application of this idea performs poorly since the data values in a cache greatly vary in their “compressibility.” The novelty of this paper is a scheme that dynamically partitions the cache into sections of different compressibilities. While compression… (More)

- Paolo Bertasi, Marco Bressan, Enoch Peserico
- SEA
- 2009

<i>psort</i> is the fastest sorting software according to the PennySort benchmark, sorting 181GB of data in 2008 and 224GB in 2009 for $0.01 of computer time. This article details its internals, and the careful fitting of its architecture to the structure of modern PC-class platforms, allowing it to outperform state-of-the-art sorting software such as… (More)

- Derek Chiou, Srinivas Devadas, +7 authors Dan Willenson
- 2001

Memory latency is a significant bottleneck in modern computing systems. With few exceptions, the process/thread/task currently running on the CPU implicitly owns all caches and main memory. Essentially, the memory is scheduled with the CPU. Generally, however, at least one memory resource is larger than any one process/thread/task and thus there is no… (More)

- Enoch Peserico
- The Journal of physiology

- Francesco Peruch, Federica Bogo, Michele Bonazza, Vincenzo-Maria Cappelleri, Enoch Peserico
- IEEE Trans. Biomed. Engineering
- 2014

We present a new technique for melanocytic lesion segmentation, Mimicking Expert Dermatologists' Segmentations (MEDS), and extensive tests of its accuracy, speed, and robustness. MEDS combines a thresholding scheme reproducing the cognitive process of dermatologists with a number of optimizations that may be of independent interest. MEDS is simple, with a… (More)