Sciweavers

528 search results - page 39 / 106
» Degrees of categoricity of computable structures
Sort
View
CANDC
2007
ACM
13 years 10 months ago
A computational model of the music of Stevie Ray Vaughan
Every musician who improvises has a unique musical vocabulary, which may be perceived in his or her compositions. In this paper, we explain our design of a computational model tha...
Naresh Vempala, Subrata Dasgupta
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
14 years 1 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
GIS
1999
ACM
14 years 28 days ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
PODC
2011
ACM
12 years 11 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
CIE
2007
Springer
14 years 2 months ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov