2654 search results - page 354 / 531 » On Pairing Inversion Problems |
141
click to vote
TCS
1998
15 years 4 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
134
click to vote
PR
2007
15 years 4 months ago
2007
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
127
Voted
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
139
Voted
CASES
2010
ACM
15 years 2 months ago
2010
ACM
Common generated instruction selections are based on tree pattern matching, but modern and custom architectures feature instructions, which cannot be covered by trees. To overcome...
119
click to vote
GLOBECOM
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper we provide a mathematical ILP model for the Regeneration Placement Problem (RPP) which minimizes the total number of regeneration nodes allocated in a translucent opt...