Sciweavers

1208 search results - page 56 / 242
» Uniform eventown problems
Sort
View
ECCC
2010
86views more  ECCC 2010»
15 years 4 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...
FUIN
2008
96views more  FUIN 2008»
15 years 4 months ago
Computational Efficiency of Intermolecular Gene Assembly
In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided re...
Tseren-Onolt Ishdorj, Remco Loos, Ion Petre
JC
2010
95views more  JC 2010»
15 years 2 months ago
Stochastic perturbations and smooth condition numbers
In this paper we dene a new condition number adapted to directionally uniform perturbations in a general framework of maps between Riemannian manifolds. The denitions and theorem...
Diego Armentano
ISAAC
2004
Springer
125views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Polyline Fitting of Planar Points Under Min-sum Criteria
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k join...
Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehl...
AAAI
2004
15 years 5 months ago
Collapsibility and Consistency in Quantified Constraint Satisfaction
The concept of consistency has pervaded studies of the constraint satisfaction problem. We introduce two concepts, which are inspired by consistency, for the more general framewor...
Hubie Chen