#### Filter Results:

- Full text PDF available (9)

#### Publication Year

2005

2018

- This year (1)
- Last 5 years (15)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Chee-Keng Yap, Vikram Sharma
- Encyclopedia of Algorithms
- 2008

Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 35.1 provides background on these problems. Although nonrobustness is… (More)

- Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
- ISSAC
- 2006

We give a unified ("basis free") framework for the Descartes method for real root isolation of square-free real polynomials. This framework encompasses the usual Descartes' rule of sign method for… (More)

- Vikram Sharma
- Theor. Comput. Sci.
- 2008

- Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
- J. Symb. Comput.
- 2018

We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C[x]. Given an oracle that provides approximations of each of the coefficients of F to any absolute error bound… (More)

- Mamta Singla, Arunajatesan Subbiya, +6 authors Vikram Sharma
- International endodontic journal
- 2015

AIM
To compare the anaesthetic efficacy of different volumes (1.8 mL vs. 3.6 mL) of 4% articaine with 1 : 100 000 epinephrine injected as buccal infiltrations after a failed inferior alveolar nerve… (More)

- Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien
- 2012 Ninth International Symposium on Voronoi…
- 2012

Voronoi diagrams are extremely versatile as a data structure for many geometric applications. Computing this diagram “exactly” for a polyhedral set in 3D has been a quest of computational geometers… (More)

- Vikram Sharma, Chee-Keng Yap
- ISSAC
- 2012

The problem of isolating all real roots of a square-free integer polynomial <i>f</i>(<i>X</i>) inside any given interval <i>I</i><sub>0</sub> is a fundamental problem. EVAL is a simple and practical… (More)

- Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee-Keng Yap
- ISSAC
- 2016

Let F(z) be an arbitrary complex polynomial. We introduce the {local root clustering problem}, to compute a set of natural epsilon-clusters of roots of F(z) in some box region B0 in the complex… (More)

- Prashant Batra, Vikram Sharma
- J. Symb. Comput.
- 2010

We propose a general framework for obtaining bounds on absolute positiveness of multivariate polynomials. We show that a known bound by Hong is a nearly optimal bound within this framework. We also… (More)

- Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
- ArXiv
- 2015

We describe a subdivision algorithm for isolating the complex roots of a polynomial F ∈ C[x]. Our model assumes that each coefficient of F has an oracle to return an approximation to any absolute… (More)