828 search results - page 158 / 166 » Simplicial Powers of Graphs |
SPAA
2003
ACM
14 years 21 days ago
2003
ACM
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
CAISE
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. The purpose of this article is to propose a scalable, topologically and traffic-wise self-adapting approach to a publish/subscribe paradigm for supporting event-based app...
INFOVIS
2002
IEEE
14 years 12 days ago
2002
IEEE
Visualization is a powerful way to facilitate data analysis, but it is crucial that visualization systems explicitly convey the presence, nature, and degree of uncertainty to user...
STACS
2001
Springer
13 years 12 months ago
2001
Springer
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential second order sentences, that is sentences of the form...
ICCAD
1999
IEEE
13 years 11 months ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...