198 search results - page 25 / 40 » Tensor Rank: Some Lower and Upper Bounds |
TCOM
2011
14 years 5 months ago
2011
—To lower costs, WDM PONs may share the usage of wavelengths, transmitters, and receivers among ONUs, instead of dedicating the transmission between OLT and each ONU with one ind...
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
DAM
2010
14 years 10 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...