16404 search results - page 2590 / 3281 » A set coverage problem |
243
Voted
EUC
2005
Springer
16 years 24 days ago
2005
Springer
As sensor networks mature the current generation of sensor networks that are application-specific and exposed only to a limited set of users will give way to heterogeneous sensor ...
188
click to vote
FASE
2005
Springer
16 years 24 days ago
2005
Springer
In situations in which developers are not familiar with a system or its documentation is inadequate, the system’s source code becomes the only reliable source of information. Unf...
199
click to vote
FSKD
2005
Springer
16 years 24 days ago
2005
Springer
Abstract. In the artificial neural networks (ANNs), feature selection is a wellresearched problem, which can improve the network performance and speed up the training of the networ...
183
click to vote
GD
2005
Springer
16 years 24 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
194
click to vote
GD
2005
Springer
16 years 24 days ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...