#### Filter Results:

#### Publication Year

2006

2012

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Spanner of an undirected graph <i>G</i> = (<i>V,E</i>) is a subgraph that is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with <i>stretch</i> <i>t</i> ∈ ℕ is a subgraph (<i>V,E<sub>S</sub></i>), <i>E<sub>S</sub></i> ⊆ <i>E</i> such that the distance between any two vertices in the subgraph is at most… (More)

This paper gives gives a deterministic algorithm to transform a row reduced matrix to canonical Popov form. Given as input a row reduced matrix <i>R</i> over K[<i>x</i>], K a field, our algorithm computes the Popov form in about the same time as required to multiply together over K[<i>x</i>] two matrices of the same dimension and degree as <i>R</i>. We also… (More)

Spanner of an undirected graph <i>G</i> = <i>(V, E)</i> is a sub graph which is sparse and yet preserves all-pairs distances approximately. More precisely, a spanner with <i>stretch t</i> ∈ IN is a subgraph <i>(V, E<sub>S</sub>), E<sub>S</sub></i> ⊆ <i>E</i> such that the distance between any two vertices in the subgraph is at most <i>t</i>… (More)

Spanner of an undirected graph G = (V, E) is a sub graph which is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E such that the distance between any two vertices in the subgraph is at most t times their distance in G. We present two randomized algorithms for maintaining a… (More)

- Soumojit Sarkar
- 2007

Let G = (V, E) be an undirected unweighted graph on |V | = n vertices and |E| = m edges. For the graph G, a spanner with stretch t is a subgraph of G with all the vertices of G in it, but a substantially sparse set of edges which preserve the property that the distance between any pair of vertices in this subgraph is at most t times the distance between… (More)

The project implemented a generalized bootstrapping algorithm for text categorization by unsupervised learning in which categories are described only by their relevant seed features. Our method uses two steps, the last one improving on the results obtained by the initial bootstrapping step of the scheme. This is a standard technique followed in unsupervised… (More)

- ‹
- 1
- ›