Sciweavers

5606 search results - page 162 / 1122
» Randomization Techniques for Graphs.
Sort
View
102
Voted
MSWIM
2005
ACM
15 years 6 months ago
Topology control with better radio models: implications for energy and multi-hop interference
Topology Control (TC) is a well-studied technique used in wireless ad hoc networks to find energy-efficient and/or low-interference subgraphs of the maxpower communication graph....
Douglas M. Blough, Mauro Leoncini, Giovanni Resta,...
110
Voted
PVLDB
2008
122views more  PVLDB 2008»
15 years 3 days ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 2 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
BIRTHDAY
2005
Springer
15 years 2 months ago
From Graph Transformation to Software Engineering and Back
Software engineers usually represent problems and solutions aph-based notations at different levels of abstractions. These notations are often semi-formal, but the use of graph tr...
Luciano Baresi, Mauro Pezzè