<--- Back to Details
First PageDocument Content
Polynomials / Polynomial / Root-finding algorithm / Kinetic data structure / Zero of a function / Polynomial interpolation / Polynomial greatest common divisor
Date: 2003-11-07 21:14:28
Polynomials
Polynomial
Root-finding algorithm
Kinetic data structure
Zero of a function
Polynomial interpolation
Polynomial greatest common divisor

Interval Methods for Kinetic Simulations Leonidas J. Guibas∗ Menelaos I. Karavelas∗ Graphics Lab., Computer Science Dept., Stanford University

Add to Reading List

Source URL: cs.smith.edu

Download Document from Source Website

File Size: 154,11 KB

Share Document on Facebook

Similar Documents

Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th

Kinetic Data Structures: Animating Proofs Through Time Julien Basch∗ Jo˜ao Comba† Leonidas J. Guibas‡ John Hershberger§ Craig D. Silverstein¶ Li Zhangk When motion begins, each certificate remains valid until th

DocID: 1rmpv - View Document

1  Continuous Skyline Queries for Moving Objects Zhiyong Huang, Hua Lu, Beng Chin Ooi, and Anthony K. H. Tung  Abstract— The literature on skyline algorithms has so far dealt

1 Continuous Skyline Queries for Moving Objects Zhiyong Huang, Hua Lu, Beng Chin Ooi, and Anthony K. H. Tung Abstract— The literature on skyline algorithms has so far dealt

DocID: 1r7I4 - View Document

Continuous Skyline Queries for Moving Objects Zhiyong Huang Hua Lu  Beng Chin Ooi

Continuous Skyline Queries for Moving Objects Zhiyong Huang Hua Lu Beng Chin Ooi

DocID: 1r6E5 - View Document

Interval Methods for Kinetic Simulations Leonidas J. Guibas∗ Menelaos I. Karavelas∗  Graphics Lab., Computer Science Dept., Stanford University

Interval Methods for Kinetic Simulations Leonidas J. Guibas∗ Menelaos I. Karavelas∗ Graphics Lab., Computer Science Dept., Stanford University

DocID: 1osGs - View Document