Sciweavers

646 search results - page 115 / 130
» Generalized connected domination in graphs
Sort
View
CIKM
2009
Springer
14 years 3 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
FOCS
2008
IEEE
14 years 3 months ago
Clock Synchronization with Bounded Global and Local Skew
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
SACRYPT
2007
Springer
126views Cryptology» more  SACRYPT 2007»
14 years 2 months ago
Improved Side-Channel Collision Attacks on AES
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
Andrey Bogdanov
AICT
2006
IEEE
14 years 2 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
COCOON
2005
Springer
14 years 2 months ago
Construction of Scale-Free Networks with Partial Information
It has recently been observed that the node degrees of many real-world large-scale networks, such as the Internet and the Web, follow a power law distributions. Since the classical...
Jianyang Zeng, Wen-Jing Hsu, Suiping Zhou