16430 search results - page 183 / 3286 » On Computable Tree Functions |
106
Voted
COMBINATORICS
2007
15 years 3 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
137
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
156
click to vote
APNOMS
2006
Springer
15 years 7 months ago
2006
Springer
For an efficient role based access control using attribute certificate in highly distributed computing environments, we use a technique of structuring role specification certificat...
103
Voted
ICN
2007
Springer
15 years 10 months ago
2007
Springer
We propose a data structure–dynamic tree bitmap–for the representation of dynamic IP router tables that must support very high lookup and update rates. In fact, the dynamic tr...
144
click to vote
ISCC
2005
IEEE
15 years 9 months ago
2005
IEEE
— We study the problem of computing minimal cost multicast trees in multi-hop wireless mesh networks. This problem is known as the Steiner tree problem, and it has been widely st...