4865 search results - page 408 / 973 » The Complexity of Graph Connectivity |
191
click to vote
PC
2000
15 years 6 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
211
click to vote
JALC
2002
15 years 6 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
185
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The complexity of large system models in software engineering nowadays is mastered by using different views. View-based modeling aims at creating small, partial models, e...
181
click to vote
PODS
2006
ACM
16 years 7 months ago
2006
ACM
Privacy-preserving query-answering systems answer queries while provably guaranteeing that sensitive information is kept secret. One very attractive notion of privacy is perfect p...
138
Voted
ESA
2007
Springer
16 years 1 months ago
2007
Springer
Given a family of k disjoint connected polygonal sites of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the dis...