Sciweavers

4761 search results - page 302 / 953
» Generalizing Boundary Points
Sort
View
176
Voted
FSTTCS
2007
Springer
16 years 9 days ago
Triangulations of Line Segment Sets in the Plane
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
Mathieu Brévilliers, Nicolas Chevallier, Do...
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 9 days ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
16 years 8 days ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
3DPVT
2006
IEEE
139views Visualization» more  3DPVT 2006»
16 years 6 days ago
A Probabilistic Notion of Correspondence and the Epipolar Constraint
We present a probabilistic framework for correspondence and egomotion. First, we suggest computing probability distributions of correspondence. This has the advantage of being rob...
Justin Domke, Yiannis Aloimonos
ETFA
2006
IEEE
16 years 6 days ago
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
In this paper we study the global scheduling of periodic task systems upon uniform multiprocessor platforms. We first show two very general properties which are wellknown for uni...
Liliana Cucu, Joël Goossens