Sciweavers

620 search results - page 57 / 124
» Algorithms and computations on cellular automata
Sort
View
CONCUR
2006
Springer
15 years 2 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
HYBRID
1999
Springer
15 years 4 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
ALT
2010
Springer
14 years 9 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
INFOCOM
2006
IEEE
15 years 6 months ago
Distributed Uplink Power Control for Optimal SIR Assignment in Cellular Data Networks
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
Prashanth Hande, Sundeep Rangan, Mung Chiang
74
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
Interference Subspace Tracking for Network Interference Alignment in Cellular Systems
— In this paper, a practical solution to implement the distributed interference alignment (IA) algorithm of [1] in a cellular communication system is proposed. In the training pe...
Bo Niu, Alexander M. Haimovich