Results 1  10
of
1,083
Bisimulation through probabilistic testing
 in “Conference Record of the 16th ACM Symposium on Principles of Programming Languages (POPL
, 1989
"... We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily clos ..."
Abstract

Cited by 529 (14 self)
 Add to MetaCart
We propose a language for testing concurrent processes and examine its strength in terms of the processes that are distinguished by a test. By using probabilistic transition systems as the underlying semantic model, we show how a testing algorithm can distinguish, with a probability arbitrarily
Probabilistic Counting Algorithms for Data Base Applications
, 1985
"... This paper introduces a class of probabilistic counting lgorithms with which one can estimate the number of distinct elements in a large collection of data (typically a large file stored on disk) in a single pass using only a small additional storage (typically less than a hundred binary words) a ..."
Abstract

Cited by 444 (6 self)
 Add to MetaCart
) and only a few operations per element scanned. The algorithms are based on statistical observations made on bits of hashed values of records. They are by con struction totally insensitive to the replicafive structure of elements in the file; they can be used in the context of distributed systems
A Logic for Reasoning about Time and Reliability
 Formal Aspects of Computing
, 1994
"... We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are inter ..."
Abstract

Cited by 371 (1 self)
 Add to MetaCart
are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satisfies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and This research report is a revised and extended version of a paper
Static Scheduling Algorithms for Allocating Directed Task Graphs to Multiprocessors
, 1999
"... Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported ..."
Abstract

Cited by 326 (5 self)
 Add to MetaCart
Devices]: Modes of ComputationParallelism and concurrency General Terms: Algorithms, Design, Performance, Theory Additional Key Words and Phrases: Automatic parallelization, DAG, multiprocessors, parallel processing, software tools, static scheduling, task graphs This research was supported
Knowledgebased protein secondary structure assignment
 Proteins
, 1995
"... ABSTRACT We have developed an automatic algorithm STRIDE for protein secondary structure assignment from atomic coordinates based on the combined use of hydrogen bond energy and statistically derived backbone torsional angle information. Parameters of the pattern recognition procedure were optimiz ..."
Abstract

Cited by 324 (2 self)
 Add to MetaCart
ABSTRACT We have developed an automatic algorithm STRIDE for protein secondary structure assignment from atomic coordinates based on the combined use of hydrogen bond energy and statistically derived backbone torsional angle information. Parameters of the pattern recognition procedure were
Supervised learning from incomplete data via an EM approach
 Advances in Neural Information Processing Systems 6
, 1994
"... Realworld learning tasks may involve highdimensional data sets with arbitrary patterns of missing data. In this paper we present a framework based on maximum likelihood density estimation for learning from such data sets. We use mixture models for the density estimates and make two distinct appeal ..."
Abstract

Cited by 232 (2 self)
 Add to MetaCart
appeals to the ExpectationMaximization (EM) principle (Dempster et al., 1977) in deriving a learning algorithmEM is used both for the estimation of mixture components and for coping with missing data. The resulting algorithm is applicable to a wide range of supervised as well as unsupervised learning
On the complexity of local search
 Proc. of 22nd ACM Symp. on Theory of Computing (STOC
, 1990
"... We investigate the complexity of finding locally optimal solutions to NPhard combinatorial optimization problems. Local optimality arises in the context of local search algorithms, which try to find improved solutions by considering perturbations of the current solution (“neighbors ” of that solut ..."
Abstract

Cited by 229 (9 self)
 Add to MetaCart
We investigate the complexity of finding locally optimal solutions to NPhard combinatorial optimization problems. Local optimality arises in the context of local search algorithms, which try to find improved solutions by considering perturbations of the current solution (“neighbors
Approximate Graph Coloring by Semidefinite Programming.
 In Proceedings of 35th Annual IEEE Symposium on Foundations of Computer Science,
, 1994
"... Abstract. We consider the problem of coloring kcolorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3colorable graph on n vertices with min{O(⌬ 1/3 log 1/2 ⌬ log n), O(n 1/4 log 1/2 n)} colors where ⌬ is the maximum degree of any vertex ..."
Abstract

Cited by 210 (7 self)
 Add to MetaCart
Abstract. We consider the problem of coloring kcolorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3colorable graph on n vertices with min{O(⌬ 1/3 log 1/2 ⌬ log n), O(n 1/4 log 1/2 n)} colors where ⌬ is the maximum degree of any
On the complexity of the parity argument and other inefficient proofs of existence
 JCSS
, 1994
"... We define several new complexity classes of search problems, "between " the classes FP and FNP. These new classes are contained, along with factoring, and the class PLS, in the class TFNP of search problems in FNP that always have a witness. A problem in each of these new classes is define ..."
Abstract

Cited by 205 (8 self)
 Add to MetaCart
; The new classes are based on lemmata such as "every graph has an even number of odddegree nodes. " They contain several important problems for which no polynomial time algorithm is presently known, including the computational versions of Sperner's lemma, Brouwer's fixpoint theorem
Iterative relative fuzzy connectedness and object definition: theory, algorithms, and application in image segmentation
 in Proceedings of IEEE Workshop on Mathematical Methods in Biomedical Image Analysis, Hilton Head
"... Images are by nature fuzzy. Approaches to object information extraction from images should attempt to use this fact and retain fuzziness as realistically as possible. In past image segmentation research, the notion of ‘‘hanging togetherness’ ’ of image elements specified by their fuzzy connectedness ..."
Abstract

Cited by 163 (15 self)
 Add to MetaCart
us to practical algorithms for fuzzy object extraction. We present algorithms for extracting a specified fuzzy object and for identifying all fuzzy objects present in the image data. We demonstrate the utility of the theory and algorithms in image segmentation based on several practical examples all
Results 1  10
of
1,083