7930 search results - page 404 / 1586 » Greedy in Approximation Algorithms |
167
click to vote
WSCG
2001
15 years 8 months ago
2001
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...
193
click to vote
FORTE
2009
15 years 4 months ago
2009
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...
185
click to vote
TVCG
2012
13 years 9 months ago
2012
— 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...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
186
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...