1387 search results - page 248 / 278 » Convexity in Discrete Space |
COMPGEOM
2009
ACM
14 years 8 days ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...
COLT
2000
Springer
13 years 12 months ago
2000
Springer
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...
ECCV
2000
Springer
13 years 12 months ago
2000
Springer
This paper introduces a new multi-view reconstruction problem called approximate N -view stereo. The goal of this problem is to recover a oneparameter family of volumes that are in...
ICRA
1999
IEEE
13 years 12 months ago
1999
IEEE
Current manufacturing methods for robotic-controlled assembly rely on accurate positioning to ensure task completion, often through the use of special xtures and precise calibrati...