13277 search results - page 2358 / 2656 » An Approach to Clustering Abstracts |
177
click to vote
IDA
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
216
click to vote
CTRSA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
207
click to vote
COCOA
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
257
click to vote
COLCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract. Mashups are defined to be lightweight Web applications aggregating data from different Web services, built using ad-hoc composition and being not concerned with long term...
176
click to vote
CONCUR
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. This paper presents SOAR: the first oblivious atomicity assertion with polynomial complexity. SOAR enables to check atomicity of a single-writer multi-reader register imp...