#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1993

2012

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Somit Gupta, Soumojit Sarkar, Arne Storjohann, Johnny Valeriote
- J. Symb. Comput.
- 2012

- Surender Baswana, Sumeet Khurana, Soumojit Sarkar
- ACM Trans. Algorithms
- 2012

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)

- Soumojit Sarkar, Arne Storjohann
- ISSAC
- 2011

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)

- Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay
- ICIC
- 2007

- Surender Baswana, Soumojit Sarkar
- SODA
- 2008

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)

- Chandan Giri, Soumojit Sarkar, Santanu Chattopadhyay
- VLSI-SoC
- 2007

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)

- S. Sarkar, G. Erlebacher, +5 authors H. O. Kreiss
- 1997

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
- ›