Sciweavers

76 search results - page 11 / 16
» Fast approximation of convex hull
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Fast Algorithms and Performance Bounds for Sum Rate Maximization in Wireless Networks
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
Chee-Wei Tan, Mung Chiang, R. Srikant
VLSISP
2010
254views more  VLSISP 2010»
13 years 8 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
CGF
1999
159views more  CGF 1999»
13 years 9 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...
CG
2005
Springer
13 years 9 months ago
Combining SP-Octrees and impostors for the visualisation of multiresolution models
Space-Partition Octree (SP-Octree) is a hierarchical representation scheme for solid modelling. It allows a multiresolution representation of polyhedral objects, and has been succ...
Francisco J. Melero, Pedro Cano, Juan Carlos Torre...
CG
2005
Springer
13 years 9 months ago
Computing geodesics on triangular meshes
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
Dimas Martínez Morera, Luiz Velho, Paulo Ce...