2542 search results - page 356 / 509 » Computing Cartograms with Optimal Complexity |
GD
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...
MP
2006
13 years 10 months ago
2006
Abstract. Traditional stochastic programming is risk neutral in the sense that it is concerned with the optimization of an expectation criterion. A common approach to addressing ri...
PERVASIVE
2006
Springer
13 years 10 months ago
2006
Springer
In this paper, we introduce MITes, a flexible kit of wireless sensing devices for pervasive computing research in natural settings. The sensors have been optimized for ease of use,...
SIAMJO
2010
13 years 5 months ago
2010
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...