3244 search results - page 107 / 649 » On convex complexity measures |
135
click to vote
EUROPAR
1995
Springer
15 years 9 months ago
1995
Springer
Abstract. Enhancingcurrentmulticomputerrouters for fault-tolerant routing with modest increasein routing complexity and resource requirements is addressed. The proposed method hand...
138
click to vote
COMGEO
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
159
click to vote
TCOM
2011
15 years 1 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
186
click to vote
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measureme...
206
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...