Sciweavers

2262 search results - page 85 / 453
» Points with large quadrant-depth
Sort
View
SSD
1993
Springer
91views Database» more  SSD 1993»
15 years 10 months ago
Volumes From Overlaying 3-D Triangulations in Parallel
Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the i...
Wm. Randolph Franklin, Mohan S. Kankanhalli
VISAPP
2008
15 years 7 months ago
Pose Clustering From Stereo Data
Abstract. This article describes an algorithm for pose or motion estimation based on clustering of parameters in the six-dimensional pose space. The parameter samples are computed ...
Ulrich Hillenbrand
FLAIRS
2000
15 years 7 months ago
Use of Data Mining on Satellite Data Bases for Knowledge Extraction
Extracting knowledge from existing sources of information is a key development area to unlock previously unknown relationships between specific data points. Data mining is a techn...
Lance Self
COMPUTING
2006
102views more  COMPUTING 2006»
15 years 6 months ago
A Reliable Area Reduction Technique for Solving Circle Packing Problems
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
Mihály Csaba Markót, Tibor Csendes
COR
2006
91views more  COR 2006»
15 years 6 months ago
An LP approach to compute the pre-kernel for cooperative games
We present an algorithm to compute the (pre)-kernel of a TU-game N, v with a system of n 2 1 linear programming problems. In contrast to the algorithms using convergence methods t...
Holger Meinhardt