Sciweavers

3096 search results - page 238 / 620
» The Generalized FITC Approximation
Sort
View
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
16 years 2 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller
INFOCOM
2009
IEEE
16 years 19 days 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
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
16 years 18 days ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
SIGIR
2009
ACM
16 years 15 days ago
Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce
This paper explores the problem of computing pairwise similarity on document collections, focusing on the application of “more like this” queries in the life sciences domain. ...
Jimmy J. Lin
IV
2008
IEEE
91views Visualization» more  IV 2008»
16 years 12 days ago
Candidate Mapping: Finding Your Place Amongst the Candidates
The process ofvoting for a candidate involves selecting an individual who best matches a personal system of values and beliefs. Typically, voters must select a candidate whom they...
Justin Donaldson, William R. Hazlewood