Sciweavers

6315 search results - page 921 / 1263
» Approximating Solution Structure
Sort
View
151
Voted
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 9 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
INFOCOM
1998
IEEE
15 years 9 months ago
An Error Control Scheme for Large-Scale Multicast Applications
Retransmission based error control for large scale multicast applications is difficult because of implosion and exposure. Existing schemes (SRM, RMTP, TMTP, LBRRM) have good solut...
Christos Papadopoulos, Guru M. Parulkar, George Va...
210
Voted
PLDI
1997
ACM
15 years 9 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
257
Voted
DIAGRAMS
2010
Springer
15 years 9 months ago
Drawing Area-Proportional Venn-3 Diagrams with Convex Polygons
Abstract. Area-proportional Venn diagrams are a popular way of visualizing the relationships between data sets, where the set intersections have a specified numerical value. In th...
Peter Rodgers, Jean Flower, Gem Stapleton, John Ho...
CCS
2006
ACM
15 years 8 months ago
Secure function evaluation with ordered binary decision diagrams
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptogr...
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh