Sciweavers

9842 search results - page 1880 / 1969
» Problem complexity
Sort
View
ICPP
2006
IEEE
14 years 4 months ago
A Formal Analysis of Space Filling Curves for Parallel Domain Decomposition
Space filling curves (SFCs) are widely used for parallel domain decomposition in scientific computing applications. The proximity preserving properties of SFCs are expected to k...
Srikanta Tirthapura, Sudip Seal, Srinivas Aluru
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 4 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
ICRA
2006
IEEE
87views Robotics» more  ICRA 2006»
14 years 4 months ago
Learning to Predict Slip for Ground Robots
— In this paper we predict the amount of slip an exploration rover would experience using stereo imagery by learning from previous examples of traversing similar terrain. To do t...
Anelia Angelova, Larry Matthies, Daniel M. Helmick...
IJCNN
2006
IEEE
14 years 4 months ago
Sparse Bayesian Models: Bankruptcy-Predictors of Choice?
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
Bernardete Ribeiro, Armando Vieira, João Ca...
ISPASS
2006
IEEE
14 years 4 months ago
Modeling TCAM power for next generation network devices
Applications in Computer Networks often require high throughput access to large data structures for lookup and classification. Many advanced algorithms exist to speed these searc...
Banit Agrawal, Timothy Sherwood
« Prev « First page 1880 / 1969 Last » Next »