Sciweavers

6315 search results - page 154 / 1263
» Approximating Solution Structure
Sort
View
CGI
1998
IEEE
15 years 10 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
CCCG
2007
15 years 8 months ago
Medial Axis Approximation of Planar Shapes from Union of Balls: A Simpler and more Robust Algorithm
Given a dense sampling S of the smooth boundary of a planar shape O. We show that the medial axis of the union of Voronoi balls centered at Voronoi vertices inside O has a particu...
Joachim Giesen, Balint Miklos, Mark Pauly
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
16 years 17 days ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
TSD
2007
Springer
16 years 16 days ago
Logic-Based Rhetorical Structuring for Natural Language Generation in Human-Computer Dialogue
Abstract. Rhetorical structuring is field approached mostly by research in natural language (pragmatic) interpretation. However, in natural language generation (NLG) the rhetorica...
Vladimir Popescu, Jean Caelen, Corneliu Burileanu
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
15 years 7 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan