6740 search results - page 1067 / 1348 » An s -Hamiltonian Line Graph Problem |
182
click to vote
ACL
1993
15 years 8 months ago
1993
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
174
click to vote
UAI
1996
15 years 8 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
193
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
In a Cyclic Mobile Ad Hoc Network (CMANET) where nodes move cyclically, we formulate trust management problems and propose the cTrust scheme to handle trust establishment and aggre...
199
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
189
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...