16093 search results - page 2786 / 3219 » On the optimality of the neighbor-joining algorithm |
198
Voted
ICSM
2007
IEEE
16 years 1 months ago
2007
IEEE
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
172
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—We present a distributed routing algorithm for finding two disjoint (primary and backup) QoS paths that run across multiple domains. Our work is inspired by the recent ...
195
click to vote
ISCAS
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract— Several network security and QoS applications require detecting multiple string matches in the packet payload by comparing it against predefined pattern set. This proc...
213
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
248
click to vote
IPSN
2007
Springer
16 years 1 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...