4131 search results - page 76 / 827 » Compactness in Topology and Computation |
160
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
161
click to vote
JSAC
2007
15 years 6 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
150
click to vote
PEWASUN
2008
ACM
15 years 7 months ago
2008
ACM
In the design of many proactive routing protocols for MANETs, it is often assumed that topology information is disseminated instantly and error free. Exceptions include hazysighte...
118
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
It has been shown ([4], [3]) that equidistant letter sequence (ELS) pairs in the book of Genesis (G) form more compact geometric patterns on the surface of a cylinder than is expe...