1717 search results - page 98 / 344 » A Computable Spectral Theorem |
136
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
159
click to vote
AISC
1998
Springer
15 years 8 months ago
1998
Springer
The use of computer algebra is usually considered beneficial for mechanised reasoning in mathematical domains. We present a case study, in the application domain of coding theory, ...
136
click to vote
ATVA
2004
Springer
15 years 8 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
126
click to vote
TSP
2008
15 years 4 months ago
2008
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
117
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
In this paper we derive a sampling theorem, which is the first one to guarantee topology preservation during digitization of 3D objects. This new theorem is applicable to several ...