#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1990

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
- Machine Learning
- 2004

We consider the problem of partitioning a set of m points in the n-dimensional Euclidean space into k clusters (usually m and n are variable, while k is fixed), so as to minimize the sum of squared distances between each point and its cluster center. This formulation is usually the objective of the k-means clustering algorithm (Kanungo et al. (2000)). We… (More)

- Manindra Agrawal, V. Vinay
- 2008 49th Annual IEEE Symposium on Foundations of…
- 2008

We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for exponential sized circuits additional depth beyond four does not help. We then show that a complete black-box derandomization of identity testing problem for depth four circuits with… (More)

- Meena Mahajan, V. Vinay
- Electronic Colloquium on Computational Complexity
- 1997

to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal's World Wide Web site for further details. The Chicago Journal of Theoretical Computer Science is a peer-reviewed scholarly journal in theoretical computer… (More)

- V Vinay
- 1998

1 Introduction We examine various counting measures on space bounded nondeterministic auxiliary pushdown machines. Hitherto, counting measures on nondeter-ministic time bounded [Val 79,KST 891 and space bounded [AJ 901 machines have been studied. In the main theorem, we show how a NAuxPDA may be simulated efficiently by a uniform family of boolean circuits,… (More)

- Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
- Theor. Comput. Sci.
- 1995

We investigate the phenomenon of depth-reduction in commutative and non-commutative arithmetic circuits. We prove that in the commutative setting, uniform semi-unbounded arithmetic circuits of logarithmic depth are as powerful as uniform arithmetic circuits of polynomial degree; earlier proofs did not work in the uniform setting. This also provides a uniied… (More)

- Petros Drineas, Alan M. Frieze, Ravi Kannan, Santosh Vempala, V. Vinay
- SODA
- 1999

We consider the problem of dividing a set of m points in Euclidean n?space into k clusters (m; n are variable while k is xed), so as to minimize the sum of distances squared of each point to its \cluster center". This formulation diiers in two ways from the most frequently considered clustering problems in the literature, namely, here we have k xed and m; n… (More)

- John N. Hooker, V. Vinay
- Journal of Automated Reasoning
- 1995

Recent experience suggests that branching algorithms are among the most attractive for solving propositional satisfiability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules with an empirical model-building approach. One model is based… (More)

- Meena Mahajan, V. Vinay
- SODA
- 1997

We show the first efficient combinatorial algorithm for the computation of the determinant Hitherto, all (known) algorithms for determinant have been based on linear algebra. In contrast, our algorithm and its proof of correctness are totally combinatorial in nature. The algorithm requires no division and works on arbitrary commutative rings. It also lends… (More)

- Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
- IEEE Conference on Computational Complexity
- 2001

We extend the lower bound techniques of [17], to the unbounded-error probabilistic model. A key step in the argument is a generalization of Nepom-njašči˘ ı's theorem from the Boolean setting to the arithmetic setting. This generalization is made possible, due to the recent discovery of logspace-uniform TC 0 circuits for iterated multiplication [11]. Here is… (More)

- Meena Mahajan, V. Vinay
- SIAM J. Discrete Math.
- 1998

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these… (More)