Sciweavers

7150 search results - page 315 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
16 years 1 months ago
On the Complexity of Reliable Root Approximation
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
Michael Kerber
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
16 years 1 months ago
An approximate dynamic programming approach to probabilistic reachability for stochastic hybrid systems
— This paper addresses the computational overhead involved in probabilistic reachability computations for a general class of controlled stochastic hybrid systems. An approximate ...
Alessandro Abate, Maria Prandini, John Lygeros, Sh...
ICPR
2008
IEEE
16 years 1 months ago
Fast approximate kernel-based similarity search for image retrieval task
In content based image retrieval, the success of any distance-based indexing scheme depends critically on the quality of the chosen distance metric. We propose in this paper a ker...
David Gorisse, Matthieu Cord, Frédér...
ESWS
2005
Springer
16 years 7 days ago
Extending HCONE-Merge by Approximating the Intended Meaning of Ontology Concepts Iteratively
A central aspect of HCONE-merge is the mapping of ontology concepts to a hidden intermediate ontology by uncovering the intended meaning of concepts. Such a mapping is realized by ...
George A. Vouros, Konstantinos Kotis