4865 search results - page 291 / 973 » The Complexity of Graph Connectivity |
207
Voted
JCO
2006
15 years 6 months ago
2006
Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research ...
158
click to vote
ASAP
2007
IEEE
16 years 1 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
170
click to vote
SIAMREV
2010
15 years 1 months ago
2010
The Lorenz attractor is one of the best known examples of applied mathematics. However, much of what is known about it is a result of numerical calculations and not of mathematica...
155
click to vote
ALT
2003
Springer
16 years 3 months ago
2003
Springer
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
248
click to vote
CC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...