#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2004

2009

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Yannet Interian, Sundar Dorai-Raj, Igor Naverniouk, P. J. Opalinski, Kaustuv, Dan Zigmond
- KDD Workshop on Data Mining and Audience…
- 2009

This paper explores the impact of television advertisements on audience retention using data collected from television set-top boxes (STBs). In particular, we discuss how the accuracy of the retention score, a measure of ad quality, is improved by using the recent "click history" of the STBs tuned to the ad. These retention scores are related to -- and are… (More)

- Igor Naverniouk
- 2005

ii Abstract Graph clustering is a well-known combinatorial problem that appears in many different incarnations. The task is to partition the vertex set of a graph in order to minimize a given cost function. Clustering has applications in VLSI design, protein-protein interaction networks, data mining and many other areas. In the context of multiobjective… (More)

- Igor Naverniouk
- 2006

We describe a O(√ log n) approximation algorithm for the Sparsest Cut problem, due to Arora, Rao and Umesh Vazirani [ARV04]. The algorithm uses Semidefinite programming and its analysis relates to notions of distortion, or more accurately average distortion of a negative type metric into 1. 1 Overview 1. We construct a Semidefinite Program (SDP) for the… (More)

In this analysis of the contact energies guiding the protein folding, the performance of the PERM algorithm on a simple, cubic lattice is examined when Miyazawa-Jernigan (MJ) and Hydrophobic-Polar (HP) energy matrices are applied. Geometric similarity of minimum energy conformations of twenty proteins, generated when HP and MJ are used, is determined by the… (More)

- ‹
- 1
- ›