1015 search results - page 130 / 203 » An efficient algorithm for AS path inferring |
128
click to vote
DCC
2008
IEEE
16 years 2 months ago
2008
IEEE
Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a me...
139
click to vote
CIKM
2004
Springer
15 years 8 months ago
2004
Springer
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
138
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
114
click to vote
WABI
2004
Springer
15 years 8 months ago
2004
Springer
—In practice, one is often faced with incomplete phylogenetic data, such as a collection of partial trees or partial splits. This paper poses the problem of inferring a phylogene...
125
click to vote
ISCC
2000
IEEE
15 years 7 months ago
2000
IEEE
With multimedia applications, the Internet traffic increased a lot in volume, but also suffered major alterations in its nature, requesting other network services besides the curr...