Sciweavers

6045 search results - page 1009 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
SMA
1995
ACM
190views Solid Modeling» more  SMA 1995»
15 years 10 months ago
Creating solid models from single 2D sketches
We describe a method of constructing a B-rep solid model from a single hidden-line removed sketch view of a 3D object. The main steps of our approach are as follows. The sketch is...
Ian J. Grimstead, Ralph R. Martin
DCOSS
2010
Springer
15 years 9 months ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....
ICS
2010
Tsinghua U.
15 years 9 months ago
Speeding up Nek5000 with autotuning and specialization
Autotuning technology has emerged recently as a systematic process for evaluating alternative implementations of a computation, in order to select the best-performing solution for...
Jaewook Shin, Mary W. Hall, Jacqueline Chame, Chun...
ICPR
2010
IEEE
15 years 9 months ago
Fast Training of Object Detection Using Stochastic Gradient Descent
Training datasets for object detection problems are typically very large and Support Vector Machine (SVM) implementations are computationally complex. As opposed to these complex ...
Rob Wijnhoven, Peter H. N. De With
APPT
2007
Springer
15 years 8 months ago
A Parallel BSP Algorithm for Irregular Dynamic Programming
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
Malcolm Yoke-Hean Low, Weiguo Liu, Bertil Schmidt
« Prev « First page 1009 / 1209 Last » Next »