Sciweavers

4106 search results - page 131 / 822
» A Computational Model for Metric Spaces
Sort
View
CIE
2005
Springer
14 years 2 months ago
Complexity of Continuous Space Machine Operations
We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for e...
Damien Woods, J. Paul Gibson
ICRA
2006
IEEE
115views Robotics» more  ICRA 2006»
14 years 3 months ago
Path Planning above a Polyhedral Terrain
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
Hamid Zarrabi-Zadeh
NPL
2002
103views more  NPL 2002»
13 years 9 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
ICASSP
2008
IEEE
14 years 3 months ago
Fine: Information embedding for document classification
The problem of document classification considers categorizing or grouping of various document types. Each document can be represented as a bag of words, which has no straightforw...
Kevin M. Carter, Raviv Raich, Alfred O. Hero
IPPS
1999
IEEE
14 years 1 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun