Sciweavers

1387 search results - page 248 / 278
» Convexity in Discrete Space
Sort
View
COMPGEOM
2009
ACM
15 years 6 months ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
IPPS
2000
IEEE
15 years 6 months ago
Dynamic Data Layouts for Cache-Conscious Factorization of DFT
Effective utilization of cache memories is a key factor in achieving high performance in computing the Discrete Fourier Transform (DFT). Most optimizationtechniques for computing ...
Neungsoo Park, Dongsoo Kang, Kiran Bondalapati, Vi...
COLT
2000
Springer
15 years 6 months ago
On the Learnability and Design of Output Codes for Multiclass Problems
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...
Koby Crammer, Yoram Singer
ECCV
2000
Springer
15 years 6 months ago
Approximate N-View Stereo
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...
Kiriakos N. Kutulakos
ICRA
1999
IEEE
97views Robotics» more  ICRA 1999»
15 years 6 months ago
Clustering of Qualitative Contact States for a Transmission Assembly
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...
Marjorie Skubic, Benjamin Forrester, Brent Nowak