12825 search results - page 1941 / 2565 » Improved PLSOM algorithm |
178
click to vote
JCT
2007
15 years 7 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
172
click to vote
JETAI
2007
15 years 7 months ago
2007
Contextual vocabulary acquisition (CVA) is the active, deliberate acquisition of a meaning for an unknown word in a text by reasoning from textual clues, prior knowledge, and hypo...
211
click to vote
TON
2008
15 years 7 months ago
2008
An optimal routing and data aggregation scheme for wireless sensor networks is proposed in this paper. The objective is to maximize the network lifetime by jointly optimizing data ...
199
click to vote
TSP
2008
15 years 7 months ago
2008
The focus of this paper is on VLIW instruction scheduling that minimizes the variation of power consumed by the processor during the execution of a target program. We use rough set...
202
click to vote
ALGORITHMICA
2004
15 years 7 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...