2735 search results - page 354 / 547 » Comparing notions of randomness |
134
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
2003
IEEE
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
143
Voted
PLDI
2010
ACM
15 years 8 months ago
2010
ACM
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
135
click to vote
SIGMOD
2010
ACM
15 years 8 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...
147
Voted
MPC
2010
Springer
15 years 8 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
140
Voted
CPM
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...