Sciweavers

394 search results - page 51 / 79
» Computing Minimal Polynomials of Matrices
Sort
View
110
Voted
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 6 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
93
Voted
ICTCS
2005
Springer
15 years 6 months ago
Inapproximability Results for the Lateral Gene Transfer Problem
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakr...
88
Voted
TAPSOFT
1991
Springer
15 years 4 months ago
Type Inference with Inequalities
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
Michael I. Schwartzbach
CCCG
2010
15 years 1 months ago
Hausdorff core of a one reflex vertex polygon
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
Robert Fraser, Patrick K. Nicholson
93
Voted
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
15 years 11 days ago
Robust optimal control of regular languages
This paper presents an algorithm for robust optimal control of regular languages under specified uncertainty bounds on the event cost parameters of the language measure that has b...
Constantino M. Lagoa, Jinbo Fu, Asok Ray