2107 search results - page 213 / 422 » Computing Small Search Numbers in Linear Time |
142
Voted
COMCOM
2006
15 years 4 months ago
2006
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
119
click to vote
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Conventional low frame rate cameras result in blur and/or aliasing in images while capturing fast dynamic events. Multiple low speed cameras have been used previously with stagger...
130
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
116
click to vote
GD
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
134
click to vote
DATE
2006
IEEE
15 years 10 months ago
2006
IEEE
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...