1232 search results - page 138 / 247 » Digraphs: theory, algorithms and applications |
IPSN
2004
Springer
14 years 2 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
EUROPAR
2003
Springer
14 years 2 months ago
2003
Springer
In this presentation, we give an overview of research activities at the Department of Computing Science, Ume˚a University with focus on Scientific, Parallel and High-Performance...
SIGMOD
2010
ACM
14 years 2 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...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...