2654 search results - page 444 / 531 » On Pairing Inversion Problems |
191
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 7 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
173
Voted
AICOM
2008
15 years 6 months ago
2008
Since speaker's intentions can be represented into domain actions (pairs of domain-independent speech acts and domain-dependent concept sequences) in goal-oriented dialogues,...
176
click to vote
CN
2010
15 years 6 months ago
2010
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...
213
click to vote
CGF
2008
15 years 6 months ago
2008
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
195
click to vote
COR
2010
15 years 6 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...