3244 search results - page 185 / 649 » On convex complexity measures |
111
click to vote
DAM
2007
15 years 1 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
130
click to vote
INFOCOM
2011
IEEE
14 years 5 months ago
2011
IEEE
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
128
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
122
click to vote
ICCAD
2010
IEEE
14 years 12 months ago
2010
IEEE
Abstract--More and more embedded systems provide a multitude of services, implemented by a large number of networked hardware components. In early design phases, dimensioning such ...
119
click to vote
IMC
2007
ACM
15 years 3 months ago
2007
ACM
The interference map of an 802.11 network is a collection of data structures that can help heuristics for routing, channel assignment and call admission in dense wireless networks...