6575 search results - page 220 / 1315 » Specializing visualization algorithms |
185
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Beamtrees are a new method for the visualization of large hierarchical data sets. Nodes are shown as stacked circular beams, such that both the hierarchical structure as well as t...
163
click to vote
ANTSW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The visual localization problem in robotics poses a dynamically changing environment due to the movement of the robot compared to a static image set serving as environmen...
173
click to vote
APVIS
2010
15 years 8 months ago
2010
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through...
150
click to vote
WEA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
142
click to vote
ALT
2007
Springer
16 years 3 months ago
2007
Springer
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...