Results 1 - 10
of
12,464
A Fast Quantum Mechanical Algorithm for Database Search
- ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract
-
Cited by 1135 (10 self)
- Add to MetaCart
superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only steps. The algorithm is within a small constant
Responses of monkey dopamine neurons to reward and conditioned stimuli during successive steps of learning a delayed response task
- J. Neurosci
, 1993
"... The present investigation had two aims: (1) to study responses of dopamine neurons to stimuli with attentional and motivationai significance during several steps of learning a behavioral task, and (2) to study the activity of dopamine neurons during the performance of cognitive tasks known to be imp ..."
Abstract
-
Cited by 200 (6 self)
- Add to MetaCart
The present investigation had two aims: (1) to study responses of dopamine neurons to stimuli with attentional and motivationai significance during several steps of learning a behavioral task, and (2) to study the activity of dopamine neurons during the performance of cognitive tasks known
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
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
Modeling Strategic Relationships for Process Reengineering
, 1995
"... Existing models for describing a process (such as a business process or a software development process) tend to focus on the \what " or the \how " of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing and appr ..."
Abstract
-
Cited by 550 (40 self)
- Add to MetaCart
Existing models for describing a process (such as a business process or a software development process) tend to focus on the \what " or the \how " of the process. For example, a health insurance claim process would typically be described in terms of a number of steps for assessing
On active contour models and balloons
- CVGIP: Image
"... The use.of energy-minimizing curves, known as “snakes, ” to extract features of interest in images has been introduced by Kass, Witkhr & Terzopoulos (Znt. J. Comput. Vision 1, 1987,321-331). We present a model of deformation which solves some of the problems encountered with the original method. ..."
Abstract
-
Cited by 588 (43 self)
- Add to MetaCart
curve need no longer be close to the solution to converge. The curve passes over weak edges and is stopped only if the edge is strong. We give examples of extracting a ventricle in medical images. We have also made a first step toward 3D object reconstruction, by tracking the extracted contour on a
A First Step towards Automated Detection of Buffer Overrun Vulnerabilities
- IN NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM
, 2000
"... We describe a new technique for finding potential buffer overrun vulnerabilities in security-critical C code. The key to success is to use static analysis: we formulate detection of buffer overruns as an integer range analysis problem. One major advantage of static analysis is that security bugs can ..."
Abstract
-
Cited by 394 (9 self)
- Add to MetaCart
We describe a new technique for finding potential buffer overrun vulnerabilities in security-critical C code. The key to success is to use static analysis: we formulate detection of buffer overruns as an integer range analysis problem. One major advantage of static analysis is that security bugs
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
- ARTIF. INTELL
, 1992
"... This paper describes a simple heuristic approach to solving large-scale constraint satisfaction and scheduling problems. In this approach one starts with an inconsistent assignment for a set of variables and searches through the space of possible repairs. The search can be guided by a value-orderin ..."
Abstract
-
Cited by 457 (6 self)
- Add to MetaCart
-ordering heuristic, the min-conflicts heuristic, that attempts to minimize the number of constraint violations after each step. The heuristic can be used with a variety of different search strategies. We demonstrate empirically that on the n-queens problem, a technique based on this approach performs orders
Image denoising by sparse 3D transform-domain collaborative filtering
- IEEE TRANS. IMAGE PROCESS
, 2007
"... We propose a novel image denoising strategy based on an enhanced sparse representation in transform domain. The enhancement of the sparsity is achieved by grouping similar 2-D image fragments (e.g., blocks) into 3-D data arrays which we call “groups.” Collaborative filtering is a special procedure d ..."
Abstract
-
Cited by 424 (32 self)
- Add to MetaCart
developed to deal with these 3-D groups. We realize it using the three successive steps: 3-D transformation of a group, shrinkage of the transform spectrum, and inverse 3-D transformation. The result is a 3-D estimate that consists of the jointly filtered grouped image blocks. By attenuating the noise
THE LIPSCHITZ PICARD SUCCESSIVE STEP METHOD IN HYDRODYNAMIC LUBRICATION PROBLEM
"... The paper shows the successive steps of approximation of Picard unification for the solution of the non-isothermal fluid flow in thin layer including inertia forces and apparent viscosities described by the non-linear dependences. In this paper is presented a unified semi analytical method of soluti ..."
Abstract
- Add to MetaCart
The paper shows the successive steps of approximation of Picard unification for the solution of the non-isothermal fluid flow in thin layer including inertia forces and apparent viscosities described by the non-linear dependences. In this paper is presented a unified semi analytical method
The HEARSAY-II speech understanding system: Integrating knowledge to resolve uncertainty
- Computing Surveys
, 1980
"... The Hearsay-II system, developed during the DARPA-sponsored five-year speech-understanding research program, represents both a specific solution to the speech-understanding problem and a general framework for coordinating independent processes to achieve cooperative problem-solving behavior. As a co ..."
Abstract
-
Cited by 392 (23 self)
- Add to MetaCart
computational problem, speech understanding reflects a large number of intrinsically interesting issues. Spoken sounds are achieved by a long chain of successive transformations, from intentions, through semantm and syntactic structurmg, to the eventually resulting audible acoustic waves. As a consequence
Results 1 - 10
of
12,464