990 search results - page 43 / 198 » Sub-Graphs of Complete Graph |
110
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
120
click to vote
RV
2010
Springer
15 years 5 days ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
141
click to vote
DAIS
2011
14 years 5 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
119
click to vote
SCN
2008
Springer
15 years 2 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
114
click to vote
VL
2007
IEEE
15 years 8 months ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...