Sciweavers

3422 search results - page 72 / 685
» Random Subset Optimization
Sort
View
113
Voted
JCM
2008
76views more  JCM 2008»
15 years 2 months ago
Waterfilling Estimation for AWGN MIMO Channel Modeled as a Random Matrix
Waterfilling solutions provide optimal power distribution in multiple-input multiple-output (MIMO) system design. However, the optimal distribution is usually obtained through cost...
Victor M. Vergara, Silvio E. Barbin, Ramiro Jordan
TMC
2012
13 years 4 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le
CIE
2007
Springer
15 years 8 months ago
Feasible Depth
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
David Doty, Philippe Moser
COCOON
2007
Springer
15 years 6 months ago
An Improved Algorithm for Online Unit Clustering
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...
Hamid Zarrabi-Zadeh, Timothy M. Chan
SODA
2004
ACM
80views Algorithms» more  SODA 2004»
15 years 3 months ago
Output-sensitive construction of the union of triangles
We present an efficient algorithm for the following problem: Given a collection T = {1, . . . , n} of n triangles in the plane, such that there exists a subset S T (unknown to us)...
Eti Ezra, Micha Sharir