Sciweavers

54 search results - page 2 / 11
» Navigation in degree of interest trees
Sort
View
PCI
2005
Springer
13 years 11 months ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
ICALP
2007
Springer
13 years 11 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
CGF
1998
142views more  CGF 1998»
13 years 5 months ago
Tree Visualisation and Navigation Clues for Information Visualisation
Information visualisation often requires good navigation aids on large trees, which represent the underlying information. Using trees for information visualisation requires novel ...
Ivan Herman, Maylis Delest, Guy Melançon
AAAI
2004
13 years 6 months ago
Rapid Object Recognition from Discriminative Regions of Interest
Object recognition and detection represent a relevant component in cognitive computer vision systems, such as in robot vision, intelligent video surveillance systems, or multi-mod...
Gerald Fritz, Christin Seifert, Lucas Paletta, Hor...
IWPC
2003
IEEE
13 years 10 months ago
YAAB (Yet Another AST Browser): Using OCL to Navigate ASTs
In the last decades several tools and environments defined and introduced languages for querying, navigating sforming abstract syntax trees. These environments were meant to supp...
Giuliano Antoniol, Massimiliano Di Penta, Ettore M...