653 search results - page 80 / 131 » The size of minimum 3-trees |
68
Voted
BROADNETS
2007
IEEE
15 years 6 months ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
FCCM
2007
IEEE
15 years 6 months ago
2007
IEEE
FPGA-based computing engines have become a promising option for the implementation of computationally intensive applications due to high flexibility and parallelism. However, one...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
112
click to vote
MMM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Recent advancements in 3D scanning technologies have inspired the development of effective methods for matching and retrieving 3D objects. A common pre-processing stage ...
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...