315 search results - page 27 / 63 » A General Small Cancellation Theory |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
The first morphological learner based upon the theory of Whole Word Morphology (Ford et al., 1997) is outlined, and preliminary evaluation results are presented. The program, Whol...
HT
2010
ACM
13 years 9 months ago
2010
ACM
We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
POPL
2003
ACM
14 years 8 months ago
2003
ACM
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...