Sciweavers

2251 search results - page 264 / 451
» Geometric Algorithms on CUDA
Sort
View
COMGEO
1999
ACM
15 years 4 months ago
Simplifying spline models
We present a new approach for simplifying models composed of rational spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cub...
M. Gopi, Dinesh Manocha
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
TIT
2011
193views more  TIT 2011»
14 years 11 months ago
Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks
—Maximization of the weighted sum-rate of secondary users (SUs) possibly equipped with multiantenna transmitters and receivers is considered in the context of cognitive radio (CR...
Seung-Jun Kim, Georgios B. Giannakis
TKDE
2011
479views more  TKDE 2011»
14 years 11 months ago
Learning Semi-Riemannian Metrics for Semisupervised Feature Extraction
—Discriminant feature extraction plays a central role in pattern recognition and classification. Linear Discriminant Analysis (LDA) is a traditional algorithm for supervised feat...
Wei Zhang, Zhouchen Lin, Xiaoou Tang