Sciweavers

7006 search results - page 292 / 1402
» Approximation Algorithms
Sort
View
WSCG
2001
134views more  WSCG 2001»
15 years 5 months ago
Synthetic Images of Underwater Scenes: A First Approximation
The creation and rendering of realistic water scenes is one of the challenging tasks in Computer Graphics. To reproduce the illumination and colour inside water bodies an algorith...
Eva Cerezo, Francisco J. Serón
138
Voted
FORTE
2009
15 years 1 months ago
Approximated Context-Sensitive Analysis for Parameterized Verification
Abstract. We propose a verification method for parameterized systems with global conditions. The method is based on context-sensitive constraints, a symbolic representation of infi...
Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezin...
TVCG
2012
201views Hardware» more  TVCG 2012»
13 years 6 months ago
Exact and Approximate Area-Proportional Circular Venn and Euler Diagrams
— Scientists conducting microarray and other experiments use circular Venn and Euler diagrams to analyze and illustrate their results. As one solution to this problem, this artic...
Leland Wilkinson
CATS
2006
15 years 5 months ago
On the Approximability of Maximum and Minimum Edge Clique Partition Problems
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
Anders Dessmark, Jesper Jansson, Andrzej Lingas, E...
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
15 years 8 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...