279 search results - page 14 / 56 » Reduction approaches for robust shortest path problems |
IEEEMSP
2002
IEEE
15 years 2 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
INFOCOM
2002
IEEE
15 years 2 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...
85
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper, we consider the problem of detecting an intruding packet in a communication network. Detection is accomplished by sampling a portion of the packets transiting selec...
SENSYS
2003
ACM
15 years 2 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
COLT
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...