2542 search results - page 338 / 509 » Computing Cartograms with Optimal Complexity |
ICASSP
2010
IEEE
13 years 10 months ago
2010
IEEE
Gaussian mixture models (GMMs) are a convenient and essential tool for the estimation of probability density functions. Although GMMs are used in many research domains from image ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Fischer proposes in [4] a sequential algorithm to compute a minimum weight spanning tree of maximum degree at most b + logb n in time O n4+1/ln b for any constant b > 1, where ...
EOR
2007
13 years 10 months ago
2007
In this paper, a new model for the semi-obnoxious facility location problem is introduced. The new model is composed of a weighted minisum function to represent the transportation...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
AROBOTS
2002
13 years 10 months ago
2002
To navigate in unknown environments, mobile robots require the ability to build their own maps. A major problem for robot map building is that odometry-based dead reckoning cannot ...