1059 search results - page 107 / 212 » Improved Algorithms via Approximations of Probability Distri... |
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
Orthogonal Variable Spreading Factor (OVSF) CDMA code has the ability to support higher and variable data rates with a single code using one transceiver. A number of CDMA code ass...
CORR
1998
Springer
14 years 9 months ago
1998
Springer
We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disa...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
ISPAN
2005
IEEE
15 years 3 months ago
2005
IEEE
- Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cy...
ISPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...