Search Results - "Crescenzi, P."

Blind image clustering based on the Normalized Cuts criterion for camera identification by Amerini, I., Caldelli, R., Crescenzi, P., Del Mastio, A., Marino, A.

“…Camera identification is a well known problem in image forensics, addressing the issue to identify the camera a digital image has been shot by. In this paper,…”
Get full text

Cophylogeny Reconstruction via an Approximate Bayesian Computation by Baudet, C., Donati, B., Sinaimeri, B., Crescenzi, P., Gautier, C., Matias, C., Sagot, M.-F

“…Despite an increasingly vast literature on cophylogenetic reconstructions for studying host-parasite associations, understanding the common evolutionary…”
Get full text

On the Hamming distance of constraint satisfaction problems by Crescenzi, P., Rossi, G.

“…In this paper we consider a new optimization problem, called M AX H AMMINGD ISTANCE ( F) where F is a family of Boolean constraints. This problem consists in…”
Get full text

Approximate solution of NP optimization problems by Ausiello, G., Crescenzi, P., Protasi, M.

“…This paper presents the main results obtained in the field of approximation algorithms in a unified framework. Most of these results have been revisited in…”
Get full text

Strictly-upward drawings of ordered search trees by Crescenzi, P., Penna, P.

“…We prove that any logarithmic binary tree admits a linear-area straight-line strictly-upward planar grid drawing (in short, strictly-upward drawing), that is,…”
Get full text

On Approximation Scheme Preserving Reducibility and Its Applications by Crescenzi, P., Trevisan, L.

Get full text

Parallel Simulated Annealing for Shape Detection by Bongiovanni, G., Crescenzi, P., Guerra, C.

“…In this paper, we describe two parallel implementations of the simulated annealing method applied to the shape detection problem. The first is a massively…”
Get full text

Linear area upward drawings of AVL trees by Crescenzi, P., Penna, P., Piperno, A.

“…We prove that any AVL tree admits a linear-area straight-line strictly-upward planar grid drawing, that is, a drawing in which (a) each edge is mapped into a…”
Get full text

Sperner's lemma and robust machines by Crescenzi, P., Silvestri, R.

Get full text

The parallel complexity of approximating the high degree subgraph problem by Andreev, A.E., Clementi, A., Crescenzi, P., Dahlhaus, E., De Agostino, S., Rolim, J.D.P.

“…The high degree subgraph problem is to find a subgraph H of a graph G such that the minimum degree of H is as large as possible. This problem is known to be…”
Get full text

Complexity Classes and Sparse Oracles by Bovet, D.P., Crescenzi, P., Silvestri, R.

“…Complexity classes are usually defined by referring to computation models and by putting suitable restrictions on them. Following this approach, many proofs of…”
Get full text

On the complexity of protein folding by Crescenzi, P, Goldman, D, Papadimitriou, C, Piccolboni, A, Yannakakis, M

“…We show that the protein folding problem in the two-dimensional H-P model is NP-complete…”
Get more information

On the connectivity of Bluetooth-based ad hoc networks by Crescenzi, P., Nocentini, C., Pietracaprina, A., Pucci, G.

“…We study the connectivity properties of a family of random graphs that closely model the Bluetooth's device discovery process, where each device tries to…”
Get full text

Development of an ECB on computer networks based on WWW technologies, resources and usability criteria by Crescenzi, P., Innocenti, G.

“…According to Baas, van den Eijnde, and Junger (2001) an electronic course book (ECB) is a learning module consisting of menu-driven hyperdocuments with a…”
Get full text

A short guide to approximation preserving reductions by Crescenzi, P.

“…Comparing the complexity of different combinatorial optimization problems has been an extremely active research area during the last 23 years. This has led to…”
Get full text

On-line algorithms for the channel assignment problem in cellular networks by Crescenzi, Pilu, Gambosi, Giorgio, Penna, Paolo

“…We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for…”
Get full text

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems by Crescenzi, Pierluigi, Silvestri, Riccardo, Trevisan, Luca

“…We investigate the approximability properties of several weighted problems, by comparing them with the respective unweighted problems. For an appropriate (and…”
Get full text

Optimal covering designs: complexity results and new bounds by Crescenzi, Pilu, Montecalvo, Federico, Rossi, Gianluca

“…In this paper we investigate the problem of computing optimal lottery schemes. From a computational complexity point of view, we prove that the variation of…”
Get full text

The minimum likely column cover problem by CRESCENZI, Pilu, GRECO, Federico

“…In this paper we introduce and study the problem of computing optimal lottery schemes in the case in which a weight function is specified over the domain set…”
Get full text

Reversible Execution and Visualization of Programs with LEONARDO by CRESCENZI, PIERLUIGI, DEMETRESCU, CAMIL, FINOCCHI, IRENE, PETRESCHI, ROSSELLA

“…In this paper we present LEONARDO, an integrated environment for software visualization that allows the user to edit, compile, execute, and animate…”
Get full text