#### Filter Results:

- Full text PDF available (15)

#### Publication Year

2008

2017

- This year (2)
- Last 5 years (15)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Erik D. Demaine, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- DISC
- 2014

We develop the first streaming algorithm and the first two-party communication protocol that uses a constant number of passes/rounds and sublinear space/communication for logarithmic approximation to the classic Set Cover problem. Specifically, for n elements andm sets, our algorithm/protocol achieves a space bound of O(m · n log n logm) using O(4)… (More)

- Chandra Chekuri, Alina Ene, Ali Vakilian
- APPROX-RANDOM
- 2012

We consider node-weighted network design problems, in particular the survivable network design problem (SNDP) and its prize-collecting version (PC-SNDP). The input consists of a node-weighted undirected graphG = (V,E) and integral connectivity requirements r(st) for each pair of nodes st. The goal is to find a minimum node-weighted subgraph H of G such… (More)

- Sariel Har-Peled, Piotr Indyk, Sepideh Mahabadi, Ali Vakilian
- PODS
- 2016

We consider the classic Set Cover problem in the data stream model. For n elements and m sets (m ≥ n) we give a O(1/δ)-pass algorithm with a strongly sub-linear ~O(mn<sup>δ</sup>) space and logarithmic approximation factor. This yields a significant improvement over the earlier algorithm of Demaine et al. [10] that uses exponentially larger… (More)

- Ali Vakilian
- 2013

We consider node-weighted network design problems, in particular the survivable network design problem (SNDP) and its prize-collecting version (PC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(st) for each pair of nodes st. The goal is to find a minimum node-weighted subgraph H of G such… (More)

- Chandra Chekuri, Alina Ene, Ali Vakilian
- ICALP
- 2012

We consider node-weighted network design in planar and minor-closed families of graphs. In particular we focus on the edge-connectivity survivable network design problem (EC-SNDP). The input consists of a node-weighted undirected graph G = (V,E) and integral connectivity requirements r(uv) for each pair of nodes uv. The goal is to find a minimum… (More)

A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. A dominating set is connected if the subgraph induced by its vertices is connected. The connected domatic partition problem asks for a partition of the nodes into connected dominating sets. The connected domatic number of a graph is the size of a… (More)

- Ali Vakilian, Farhad Iranmanesh, Ali Esmaeili Nadimi, Jafar Ahmadi Kahnali
- Journal of the College of Physicians and Surgeons…
- 2011

OBJECTIVE
To compare heart rate variability (HRV) and QT dispersion in comatose patients with normal brainstem function and with brain death.
STUDY DESIGN
Cross-sectional comparative study.
PLACE AND DURATION OF STUDY
The Intensive Care Unit of Ali-Ebn-Abitaleleb Hopital, Rafsanjan Medical University from September 2007 to June 2009.
METHODOLOGY… (More)

- Alina Ene, Ali Vakilian
- STOC
- 2014

We consider <i>degree bounded</i> network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph <i>G</i> = (<i>V, E</i>) with weights <i>w</i>(<i>e</i>) on the edges and degree bounds <i>b</i>(<i>v</i>) on the vertices, and connectivity requirements… (More)

- Arash Termehchy, Ali Vakilian, Yodsawalai Chodpathumwan, Marianne Winslett
- SIGMOD Conference
- 2014

It is well established that extracting and annotating occurrences of entities in a collection of unstructured text documents with their concepts improve the effectiveness of answering queries over the collection. However, it is very resource intensive to create and maintain large annotated collections. Since the available resources of an enterprise are… (More)

- Alina Ene, Nitish Korula, Ali Vakilian
- ArXiv
- 2013