Sciweavers

717 search results - page 71 / 144
» The Viewing Graph
Sort
View
VLDB
2001
ACM
138views Database» more  VLDB 2001»
14 years 4 days ago
A Data Warehousing Architecture for Enabling Service Provisioning Process
In this paper we focus on the following problem in information management: given a large collection of recorded information and some knowledge of the process that is generating th...
Yannis Kotidis
IACR
2011
166views more  IACR 2011»
12 years 7 months ago
Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family
We introduce a new concept in splice-and-cut attacks on hash functions, which bridges the gap between preimage attacks and a powerful method of differential cryptanalysis. The ne...
Dmitry Khovratovich, Christian Rechberger, Alexand...
CACM
2008
53views more  CACM 2008»
13 years 7 months ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
ICSM
2005
IEEE
14 years 1 months ago
Towards Employing Use-Cases and Dynamic Analysis to Comprehend Mozilla
This paper presents an approach for comprehending large software systems using views that are created by subjecting the software systems to dynamic analysis under various use-case...
Maher Salah, Spiros Mancoridis, Giuliano Antoniol,...
EOR
2006
57views more  EOR 2006»
13 years 7 months ago
Routing and wavelength assignment by partition colouring
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
Thiago F. Noronha, Celso C. Ribeiro