Sciweavers

10988 search results - page 382 / 2198
» Algorithmic Folding Complexity
Sort
View
CN
2002
98views more  CN 2002»
15 years 4 months ago
New models and algorithms for programmable networks
In todays IP networks most of the network control and management tasks are performed at the end points. As a result, many important network functions cannot be optimized due to la...
Danny Raz, Yuval Shavitt
ICML
2007
IEEE
16 years 5 months ago
CarpeDiem: an algorithm for the fast evaluation of SSL classifiers
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
Roberto Esposito, Daniele P. Radicioni
156
Voted
EUROPAR
2004
Springer
15 years 10 months ago
Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
Kayhan Erciyes
131
Voted
WIA
2001
Springer
15 years 9 months ago
Cascade Decompositions are Bit-Vector Algorithms
A vector algorithm is an algorithm that applies a bounded number of vector operations to an input vector, regardless of the length of the input. In this paper, we describe the link...
Anne Bergeron, Sylvie Hamel
135
Voted
WISE
2000
Springer
15 years 9 months ago
A Model for Evaluating Materialized View Maintenance Algorithms
Many algorithms have been proposed in the area of materialized view maintenance. They provide different capabilities and features, and have different complexity in their implement...
Tok Wang Ling, Eng Koon Sze