Sciweavers

14386 search results - page 276 / 2878
» The Chinese Generals Problem
Sort
View
WADS
2007
Springer
113views Algorithms» more  WADS 2007»
15 years 11 months ago
On Computing the Centroid of the Vertices of an Arrangement and Related Problems
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all `n 2 ´ verti...
Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans R...
127
Voted
FOCS
2006
IEEE
15 years 11 months ago
Algebraic Structures and Algorithms for Matching and Matroid Problems
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
Nicholas J. A. Harvey
170
Voted
ICPR
2006
IEEE
15 years 11 months ago
Regularized Locality Preserving Learning of Pre-Image Problem in Kernel Principal Component Analysis
In this paper, we address the pre-image problem in kernel principal component analysis (KPCA). The preimage problem finds a pattern as the pre-image of a feature vector defined in...
Weishi Zheng, Jian-Huang Lai
ATAL
2005
Springer
15 years 10 months ago
Coordinated exploration of unknown labyrinthine environments applied to the pursuit evasion problem
This paper introduces a multi-robot cooperation approach to solve the pursuit evasion problem for mobile robots that have omnidirectional vision sensors in unknown environments. T...
Damien Pellier, Humbert Fiorino
ESA
2003
Springer
140views Algorithms» more  ESA 2003»
15 years 10 months ago
Improved Approximation of the Stable Marriage Problem
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
Magnús M. Halldórsson, Kazuo Iwama, ...