2086 search results - page 317 / 418 » Mathematical Theory Exploration |
125
click to vote
COMPGEOM
2010
ACM
15 years 6 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
125
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
119
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
117
click to vote
ICRE
2000
IEEE
15 years 6 months ago
2000
IEEE
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
125
Voted
WADT
1999
Springer
15 years 6 months ago
1999
Springer
Based on the FOCUS theory of distributed systems (see [Broy, Stølen 01]) that are composed of interacting components we introduce a formal model of services and layered architectu...