Sciweavers

36 search results - page 7 / 8
» Proof Spaces for Unbounded Parallelism
Sort
View
PDCAT
2007
Springer
15 years 4 months ago
Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors
When datasets are distributed on different sources, finding out their intersection while preserving the privacy of the datasets is a widely required task. In this paper, we addre...
Yingpeng Sang, Hong Shen
IPPS
2000
IEEE
15 years 2 months ago
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
Ajoy Kumar Datta, Maria Gradinariu, Sébasti...
TKDE
2002
239views more  TKDE 2002»
14 years 10 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
AAAI
1993
14 years 11 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
PODC
2009
ACM
15 years 11 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...