Results 1  10
of
329,995
A computational approach to edge detection
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1986
"... This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumpti ..."
Abstract

Cited by 4675 (0 self)
 Add to MetaCart
. With this principle we derive a single operator shape which is optimal at any scale. The optimal detector has a simple approximate implementation in which edges are marked at maxima in gradient magnitude of a Gaussiansmoothed image. We extend this simple detector using operators of several widths to cope
Fitting a mixture model by expectation maximization to discover motifs in biopolymers.
 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 twocomponent 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
to the data, probabilistically erasing tile occurrences of the motif thus found, and repeating the process to find successive motifs. The algorithm requires only a set of unaligned sequences and a number specifying the width of the motifs as input. It returns a model of each motif and a threshold which
Face recognition: features versus templates
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1993
"... Over the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per person). We ..."
Abstract

Cited by 749 (25 self)
 Add to MetaCart
Over the last 20 years, several different techniques have been proposed for computer recognition of human faces. The purpose of this paper is to compare two simple but general strategies on a common database (frontal images of faces of 47 people: 26 males and 21 females, four images per person
widths, and
"... Total integrated scatter from surfaces with arbitrary roughness, correlation ..."
Abstract
 Add to MetaCart
Total integrated scatter from surfaces with arbitrary roughness, correlation
Approximating cliquewidth and branchwidth
 JOURNAL OF COMBINATORIAL THEORY, SERIES B
, 2006
"... We construct a polynomialtime algorithm to approximate the branchwidth of certain symmetric submodular functions, and give two applications. The first is to graph “cliquewidth”. Cliquewidth is a measure of the difficulty of decomposing a graph in a kind of treestructure, and if a graph has cl ..."
Abstract

Cited by 115 (15 self)
 Add to MetaCart
k + 1. (The best earlier algorithm algorithm, by Johansson [13], constructed a k log nexpression for graphs of cliquewidth at most k.) It was already known that several graph problems, NPhard on general graphs, are solvable in polynomial time if the input graph comes equipped with a k
Factors affecting the zwidth of a haptic display
 in Proceedings of the IEEE International Conference on Robotics and Automation
, 1994
"... This paper addresses the performance of forcereflecting interfaces (“haptic displays”). We suggest that an important measure of performance is the dynamic range of achievable impedances — “ZWidth ” — and that an impedance is achievable if it satisfies a robustness property such as passivity. Seve ..."
Abstract

Cited by 178 (7 self)
 Add to MetaCart
. Several factors affecting ZWidth — sampleandhold, inherent interface dynamics, displacement sensor quantization, and velocity filtering — are discussed. A set of experiments designed to evaluate these factors is described, and experimental results are presented. A striking result is that inherent
The Global Ozone Monitoring Experiment (GOME): Mission Concept and First Scientific Results
, 1999
"... . The Global Ozone Monitoring Experiment (GOME) is a new instrument aboard ESA's 2nd European Remote Sensing Satellite (ERS2) , which was launched in April 1995. The main scientific objective of the GOME mission is to determine the global distribution of ozone and several other trace gases, whi ..."
Abstract

Cited by 303 (67 self)
 Add to MetaCart
. The Global Ozone Monitoring Experiment (GOME) is a new instrument aboard ESA's 2nd European Remote Sensing Satellite (ERS2) , which was launched in April 1995. The main scientific objective of the GOME mission is to determine the global distribution of ozone and several other trace gases
Linear time solvable optimization problems on graphs of bounded cliquewidth
, 2000
"... Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones. On graphs of treewidth at most k, i.e., that have tree decompositions of width at most k, where k is fixed, every dec ..."
Abstract

Cited by 170 (24 self)
 Add to MetaCart
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones. On graphs of treewidth at most k, i.e., that have tree decompositions of width at most k, where k is fixed, every
Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance
, 1999
"... In generalpurpose microprocessors, recent trends have pushed towards 64bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer problems, however, rarely need the full 64bit dynamic range these CPUs provide. In fact, another recent instruction set trend ..."
Abstract

Cited by 151 (7 self)
 Add to MetaCart
In generalpurpose microprocessors, recent trends have pushed towards 64bit word widths, primarily to accommodate the large addressing needs of some programs. Many integer problems, however, rarely need the full 64bit dynamic range these CPUs provide. In fact, another recent instruction set trend
A Combinatorial Characterization of Resolution Width
 In 18th IEEE Conference on Computational Complexity
, 2002
"... We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context of finite model theory. The characterization is tight and purely combinatorial. Our first application of this result i ..."
Abstract

Cited by 52 (6 self)
 Add to MetaCart
is a surprising proof that the minimum space of refuting a 3CNF formula is always bounded from below by the minimum width of refuting it (minus 3). This solves a wellknown open problem. The second application is the unification of several width lower bound arguments, and a new width lower bound
Results 1  10
of
329,995