848 search results - page 23 / 170 » Randomness and the linear degrees of computability |
148
click to vote
ISSAC
1997
Springer
15 years 9 months ago
1997
Springer
Las Vegas algorithms that are based on Lanczos’s method for solving symmetric linear systems are presented and analyzed. These are compared to a similar randomized Lanczos algor...
105
click to vote
ICPR
2006
IEEE
16 years 6 months ago
2006
IEEE
It has been shown ([4], [3]) that equidistant letter sequence (ELS) pairs in the book of Genesis (G) form more compact geometric patterns on the surface of a cylinder than is expe...
122
click to vote
DCOSS
2005
Springer
15 years 11 months ago
2005
Springer
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
151
click to vote
RECOMB
2006
Springer
16 years 5 months ago
2006
Springer
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
180
click to vote
SASN
2004
ACM
15 years 11 months ago
2004
ACM
Key management is one of the fundamental building blocks of security services. In a network with resource constrained nodes like sensor networks, traditional key management techni...