Sciweavers

2520 search results - page 39 / 504
» The complexity of approximating entropy
Sort
View
STOC
2002
ACM
105views Algorithms» more  STOC 2002»
15 years 10 months ago
Approximating the smallest grammar: Kolmogorov complexity in natural models
Moses Charikar, Eric Lehman, Ding Liu, Rina Panigr...
CGI
1998
IEEE
15 years 2 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...
DAM
2008
131views more  DAM 2008»
14 years 10 months ago
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
Márcia R. Cerioli, L. Faria, T. O. Ferreira...
CORR
2011
Springer
192views Education» more  CORR 2011»
14 years 5 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...