Sciweavers

1431 search results - page 124 / 287
» The complexity of random ordered structures
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 3 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
DAWAK
2007
Springer
15 years 9 months ago
Automating the Schema Matching Process for Heterogeneous Data Warehouses
Abstract. A federated data warehouse is a logical integration of data warehouses applicable when physical integration is impossible due to privacy policy or legal restrictions. In ...
Marko Banek, Boris Vrdoljak, A. Min Tjoa, Zoran Sk...
IEEEICCI
2007
IEEE
15 years 9 months ago
Underwater surface recovery and segmentation
Abstract— The underwater environment presents many challenges for robotic sensing including highly variable lighting and the presence of dynamic objects such as fish and suspend...
Michael R. M. Jenkin, Andrew Hogue, Andrew German,...
COMPGEOM
2011
ACM
14 years 6 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 7 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot