3204 search results - page 310 / 641 » The Alcuin Number of a Graph |
196
click to vote
DC
2010
15 years 6 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
188
click to vote
JNSM
2008
15 years 6 months ago
2008
We optimally place intrusion detection system (IDS) sensors and prioritize IDS alerts using attack graph analysis. We begin by predicting all possible ways of penetrating a networ...
168
Voted
DM
2007
15 years 6 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
156
click to vote
ICIP
2000
IEEE
16 years 8 months ago
2000
IEEE
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
168
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...