1413 search results - page 47 / 283 » ideas 2007 |
117
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
Large and complex enterprise systems face the same kind of information processing problems that exist on the web in general, and constructing an ontology is a crucial part of many ...
126
click to vote
FCT
2007
Springer
15 years 10 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
121
click to vote
FSEN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we offer a novel methodology for verifying correctness of (timed) security protocols. The idea consists in computing the time of a correct execution of a s...
116
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper derives a new algorithm that performs independent component analysis (ICA) by optimizing the contrast function of the RADICAL algorithm. The core idea of the p...
132
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...