4110 search results - page 197 / 822 » Efficient algorithms for the 2-gathering problem |
197
click to vote
IWOCA
2010
Springer
15 years 1 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
167
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
170
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
197
click to vote
ICUMT
2009
15 years 4 months ago
2009
We consider the problem of joint power control, scheduling and routing in energy harvesting sensor networks allowing for multicast of data generated at the sensor nodes to a set of...
186
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Point-based geometric models are gaining popularity in both the computer graphics and CAD fields. A related design/modelling problem is the focus of the reported research: drawing...