706 search results - page 77 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
Pre-processing algorithms improve the quality of a compression system by removing unimportant data before encoding. This enhances both the visual quality and coding efficiency of ...
ICNS
2007
IEEE
14 years 3 months ago
2007
IEEE
In this paper, the problem of discovering anomalies in a large-scale network based on the data fusion of heterogeneous monitors is considered. We present a classification of anoma...
IWANN
1999
Springer
14 years 1 months ago
1999
Springer
Abstract: Support vector machines (SVMs) are primarily designed for 2-class classification problems. Although in several papers it is mentioned that the combination of K SVMs can b...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
— Directional antennas can be useful in significantly increasing node and network lifetime in wireless ad hoc networks. In order to utilize directional antennas, an algorithm is ...