Sciweavers

1086 search results - page 42 / 218
» Jug measuring: Algorithms and complexity
Sort
View
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
14 years 12 days ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
ICPR
2004
IEEE
15 years 2 days ago
Convexity Recognition Using Multi-Scale Autoconvolution
This paper introduces a novel measure for object convexity using the recently introduced Multi-Scale Autoconvolution transform. The proposed measure is computationally efficient a...
Esa Rahtu, Mikko Salo, Janne Heikkilä
IJAC
2007
116views more  IJAC 2007»
13 years 11 months ago
On the Complexity of the Whitehead Minimization Problem
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
Abdó Roig, Enric Ventura, Pascal Weil
BVAI
2005
Springer
14 years 4 months ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov
IMSCCS
2006
IEEE
14 years 5 months ago
A New Scheduling Algorithm for Servers
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni