Sciweavers

2542 search results - page 50 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
SIGGRAPH
1997
ACM
13 years 12 months ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
SIGGRAPH
1993
ACM
13 years 11 months ago
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
Thomas A. Funkhouser, Carlo H. Séquin
ICC
2007
IEEE
141views Communications» more  ICC 2007»
14 years 2 months ago
A Decomposition-Based Low-Complexity Scheduling Scheme for Power Minimization under Delay Constraints in Time-Varying Uplink Cha
Abstract— In this paper, we investigate the problem of minimizing the average transmission power of users while guaranteeing the average delay constraints in time-varying uplink ...
Hojoong Kwon, Byeong Gi Lee
TCOM
2008
151views more  TCOM 2008»
13 years 7 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee
CORR
2008
Springer
208views Education» more  CORR 2008»
13 years 7 months ago
Equilibria, Fixed Points, and Complexity Classes
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
Mihalis Yannakakis