Sciweavers

30 search results - page 4 / 6
» Barycentric coordinates for convex sets
Sort
View
PROCEDIA
2010
67views more  PROCEDIA 2010»
13 years 4 months ago
Using the feasible set method for rezoning in ALE
One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is ...
Markus Berndt, Milan Kucharik, Mikhail J. Shashkov
CGF
2010
82views more  CGF 2010»
13 years 5 months ago
Poisson-Based Weight Reduction of Animated Meshes
While animation using barycentric coordinates or other automatic weight assignment methods has become a popular method for shape deformation, the global nature of the weights limi...
Eric Landreneau, Scott Schaefer
ICNP
2007
IEEE
14 years 2 days ago
Greedy Virtual Coordinates for Geographic Routing
— We present a new approach for generating virtual coordinates that produces usable coordinates quickly and improves the routing performance of existing geographic routing algori...
Ben Leong, Barbara Liskov, Robert Morris
WIOPT
2010
IEEE
13 years 3 months ago
Iterative power and subcarrier allocation for maximizing WSMR in cellular OFDMA systems
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...
Tao Wang, Luc Vandendorpe
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 6 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett