4526 search results - page 561 / 906 » Algorithmic problems related to the Internet |
229
Voted
RTSS
1992
IEEE
15 years 11 months ago
1992
IEEE
The problem of scheduling a set of sporadic tasks that share a set of serially reusable, single unit software resources on a single processor is considered. The correctness condit...
165
click to vote
EUROCRYPT
2006
Springer
15 years 10 months ago
2006
Springer
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
163
Voted
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
204
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
173
click to vote
SMI
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper a novel clustering algorithm is proposed, namely Variational Multilevel Mesh Clustering (VMLC). The algorithm incorporates the advantages of both hierarchical and va...