Sciweavers

833 search results - page 66 / 167
» Geometric Optimization
Sort
View
COMPGEOM
2009
ACM
15 years 8 months ago
Epsilon nets and union complexity
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
Kasturi R. Varadarajan
GLOBECOM
2007
IEEE
15 years 6 months ago
Efficient Scheduling for Heterogeneous Services in OFDMA Downlink
We consider optimal allocation of resources to users in a downlink OFDMA system to support heterogeneous applications consisting of both deadline-sensitive (DS) and best-effort (BE...
Rajiv Agarwal, Vinay R. Majjigi, Rath Vannithamby,...
DAC
2004
ACM
16 years 3 months ago
ORACLE: optimization with recourse of analog circuits including layout extraction
Long design cycles due to the inability to predict silicon realities is a well-known problem that plagues analog/RF integrated circuit product development. As this problem worsens...
Yang Xu, Lawrence T. Pileggi, Stephen P. Boyd
INFOCOM
2011
IEEE
14 years 6 months ago
Sharing multiple messages over mobile networks
—Information dissemination in a large network is typically achieved when each user shares its own information or resources with each other user. Consider n users randomly located...
Yuxin Chen, Sanjay Shakkottai, Jeffrey G. Andrews
CORR
2008
Springer
85views Education» more  CORR 2008»
15 years 2 months ago
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
The method of stable random projections is an efficient tool for computing the l distances using low memory, where 0 < 2 may be viewed as a tuning parameter. This method boil...
Ping Li