966 search results - page 110 / 194 » Small Alliances in Graphs |
121
Voted
SP
2008
IEEE
15 years 7 months ago
2008
IEEE
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
102
click to vote
CIVR
2007
Springer
15 years 6 months ago
2007
Springer
The ability to match faces in video is a crucial component for many multimedia applications such as searching and recognizing people in semantic video browsing, surveillance and h...
115
Voted
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
97
Voted
ADAEUROPE
2004
Springer
15 years 6 months ago
2004
Springer
The tree width of a graph G measures how close G is to being a tree or a series-parallel graph. Many well-known problems that are otherwise NP-complete can be solved efficiently if...
106
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...