Sciweavers

2899 search results - page 271 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
COMPGEOM
2004
ACM
16 years 3 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
WACV
2008
IEEE
16 years 1 months ago
Online/Realtime Structure and Motion for General Camera Models
This paper presents a novel algorithm for online structure and motion estimation. The algorithm works for general camera models and minimizes object space error, it does not rely ...
Gerald Schweighofer, Sinisa Segvic, Axel Pinz
NETWORKING
2000
15 years 8 months ago
Spare Capacity Planning for Survivable Mesh Networks
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...
Adel Al-Rumaih, David Tipper, Yu Liu, Bryan A. Nor...
SIGMOD
1993
ACM
150views Database» more  SIGMOD 1993»
15 years 10 months ago
Predicate Migration: Optimizing Queries with Expensive Predicates
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...
Joseph M. Hellerstein, Michael Stonebraker
STACS
2005
Springer
16 years 4 days ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt