Sciweavers

1105 search results - page 67 / 221
» Linear choosability of graphs
Sort
View
TVCG
2010
141views more  TVCG 2010»
14 years 10 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
AMFG
2005
IEEE
155views Biometrics» more  AMFG 2005»
15 years 5 months ago
Linear Programming for Matching in Human Body Gesture Recognition
We present a novel human body gesture recognition method using a linear programming based matching scheme. Instead of attempting to segment an object from the background, we develo...
Hao Jiang, Ze-Nian Li, Mark S. Drew
EMMCVPR
2005
Springer
15 years 5 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li
STACS
1997
Springer
15 years 4 months ago
Methods and Applications of (MAX, +) Linear Algebra
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
Stephane Gaubert, Max Plus
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
14 years 11 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...