Sciweavers

3897 search results - page 129 / 780
» complexity 2010
Sort
View
JSYML
2010
95views more  JSYML 2010»
13 years 5 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
CCCG
2010
13 years 11 months ago
On degeneracy of lower envelopes of algebraic surfaces
We analyze degeneracy of lower envelopes of algebraic surfaces. We focus on the cases omitted in the existing complexity analysis of lower envelopes [Halperin and Sharir 1993], an...
Kimikazu Kato
ECCC
2010
86views more  ECCC 2010»
13 years 10 months ago
On Approximating the Entropy of Polynomial Mappings
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P...
ECCC
2007
86views more  ECCC 2007»
13 years 10 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
CGF
2010
111views more  CGF 2010»
13 years 8 months ago
The Perception of Correlation in Scatterplots
We present a rigorous way to evaluate the visual perception of correlation in scatterplots, based on classical psychophysical methods originally developed for simple properties su...
Ronald A. Rensink, Gideon Baldridge