Results 1 - 10 of 152,870

Non-Uniform Random Variate Generation

by Luc Devroye , 1986
"... This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various algorith ..."
Abstract - Cited by 1021 (26 self) - Add to MetaCart
This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and transformations are reviewed. We provide information on the expected time complexity of various

An algorithm for finding best matches in logarithmic expected time

by Jerome H. Friedman, Jon Louis Bentley, Raphael Ari Finkel - ACM Transactions on Mathematical Software , 1977
"... An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number of recor ..."
Abstract - Cited by 764 (2 self) - Add to MetaCart
An algorithm and data structure are presented for searching a file containing N records, each described by k real valued keys, for the m closest matches or nearest neighbors to a given query record. The computation required to organize the file is proportional to kNlogN. The expected number

Expected Time Bounds for Selection

by Robert W. Floyd, Ronald L. Rivest , 1975
"... A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q- min(i,n--i) q- o(n). A lower bound within 9 percent of the above formula is also derived. ..."
Abstract - Cited by 459 (4 self) - Add to MetaCart
A new selection algorithm is presented which is shown to be very efficient on the average, both theoretically and practically. The number of comparisons used to select the ith smallest of n numbers is n q- min(i,n--i) q- o(n). A lower bound within 9 percent of the above formula is also derived.

The architecture of complexity

by Herbert A. Simon - Proceedings of the American Philosophical Society , 1962
"... A number of proposals have been advanced in recent years for the development of “general systems theory ” that, abstracting from properties peculiar to physical, biological, or social systems, would be applicable to all of them. 1 We might well feel that, while the goal is laudable, systems of such ..."
Abstract - Cited by 772 (1 self) - Add to MetaCart
of such diverse kinds could hardly be expected to have any nontrivial properties in common. Metaphor and analogy can be helpful, or they can be misleading. All depends on whether the similarities the metaphor captures are significant or superficial. It may not be entirely vain, however, to search for common

Fitting a mixture model by expectation maximization to discover motifs in biopolymers.

by Timothy L Bailey , Charles Elkan - Proc Int Conf Intell Syst Mol Biol , 1994
"... Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a two-component finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model to th ..."
Abstract - Cited by 947 (5 self) - Add to MetaCart
Abstract The algorithm described in this paper discovers one or more motifs in a collection of DNA or protein sequences by using the technique of expect~tiou ma.,dmization to fit a two-component finite mixture model to the set of sequences. Multiple motifs are found by fitting a mixture model

The complexity of theorem-proving procedures

by Stephen A. Cook - IN STOC , 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract - Cited by 1050 (5 self) - Add to MetaCart
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM , 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a bounded-error probabilistic Turing machine, and thus not in the class

A theory of timed automata

by Rajeev Alur , 1999
"... Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis of ..."
Abstract - Cited by 2651 (32 self) - Add to MetaCart
Model checking is emerging as a practical tool for automated debugging of complex reactive systems such as embedded controllers and network protocols (see [23] for a survey). Traditional techniques for model checking do not admit an explicit modeling of time, and are thus, unsuitable for analysis

Time Varying World Market Integration

by Geert Bekaert, Campbell R. Harvey - JOURNAL OF FINANCE , 1995
"... We propose a measure of capital market integration arising from a conditional regime-switching model. Our measure allows us to describe expected returns in countries that are segmented from world capital markets in one part of the sample and become integrated later in the sample. We find that a numb ..."
Abstract - Cited by 546 (40 self) - Add to MetaCart
number of emerging markets exhibit time-varying integration. Some markets appear more integrated than one might expect based on prior knowledge of investment restrictions. Other markets appear segmented even though foreigners have relatively free access to their capital markets. While there is a

Statecharts: A Visual Formalism For Complex Systems

by David Harel , 1987
"... We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we cal ..."
Abstract - Cited by 2704 (56 self) - Add to MetaCart
We present a broad extension of the conventional formalism of state machines and state diagrams, that is relevant to the specification and design of complex discrete-event systems, such as multi-computer real-time systems, communication protocols and digital control units. Our diagrams, which we
Results 1 - 10 of 152,870