549 search results - page 18 / 110 » Computing All the Best Swap Edges Distributively |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
DM
2010
14 years 9 months ago
2010
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
NIPS
2004
14 years 11 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
ICPPW
2007
IEEE
15 years 4 months ago
2007
IEEE
With the growth in the computation capacity of sensor nodes, they are increasingly equipped to handle more complex functions. Moreover, the need to realize the complete loop of se...