#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2004

2010

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Tom Broxton, Yannet Interian, Jon Vaver, Mirjam Wattenhofer
- Journal of Intelligent Information Systems
- 2010

The sharing and re-sharing of videos on social sites, blogs e-mail, and other means has given rise to the phenomenon of viral videosâ€”videos that become popular through internet sharing. In this paperâ€¦ (More)

- Hubie Chen, Yannet Interian
- IJCAI
- 2005

The quantified boolean formula (QBF) problem is a powerful generalization of the boolean satisfiability (SAT) problem where variables can be both universally and existentially quantified. Inspired byâ€¦ (More)

- Yacine Boufkhad, Olivier Dubois, Yannet Interian, Bart Selman
- Journal of Automated Reasoning
- 2005

We consider a model for generating random k-SAT formulas, in which each literal occurs approximately the same number of times in the formula clauses (regular random and k-SAT). Our experimentalâ€¦ (More)

- Yannet Interian, Gabriel Corvera, Bart Selman, Ryan Williams
- ISAIM
- 2006

In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new efforts have focused on developing solvers forâ€¦ (More)

Google aggregates data, collected and anonymized by the DISH Network L.L.C., describing the precise second-by-second tuning behavior for millions of television set-top boxes, covering millions of USâ€¦ (More)

This paper proposes a new algorithm for the genomic median problem that combines greedy and stochastic search. Our computational experiments suggest that for more complex problems our algorithm findsâ€¦ (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â€¦ (More)

- Yannet Interian
- SAT
- 2004

We provide a rigorous analysis of a greedy approximation algorithm for the maximum random k-SAT (MAX-R-kSAT) problem. The algorithm assigns variables one at a time in a predefined order. A variableâ€¦ (More)

In the past few years, we have seen significant progress in the area of Boolean satisfiability (SAT) solving and its applications. More recently, new efforts have focused on developing solvers forâ€¦ (More)

- â€¹
- 1
- â€º