Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
14,153
BASIC SOLUTIONS
, 2013
"... hexane 30 110-54-3 chloroform 67-66-3 dichlorome 75-09-2 dimethylfor 68-12-2 toluene 1-3 108-88-3 Anisole 1-5 100-66-3 cyclohexan 110-82-7 decane 1-5 124-18-5 ether 1-5 % 60-29-7 ..."
Abstract
- Add to MetaCart
hexane 30 110-54-3 chloroform 67-66-3 dichlorome 75-09-2 dimethylfor 68-12-2 toluene 1-3 108-88-3 Anisole 1-5 100-66-3 cyclohexan 110-82-7 decane 1-5 124-18-5 ether 1-5 % 60-29-7
USER’S GUIDE TO VISCOSITY SOLUTIONS OF SECOND ORDER PARTIAL DIFFERENTIAL EQUATIONS
, 1992
"... The notion of viscosity solutions of scalar fully nonlinear partial differential equations of second order provides a framework in which startling comparison and uniqueness theorems, existence theorems, and theorems about continuous dependence may now be proved by very efficient and striking argume ..."
Abstract
-
Cited by 1399 (16 self)
- Add to MetaCart
arguments. The range of important applications of these results is enormous. This article is a self-contained exposition of the basic theory of viscosity solutions.
Using Fast Matrix Multiplication to Find Basic Solutions
, 1993
"... We consider the problem of finding a basic solution to a system of linear constraints (in standard form) given a non-basic solution to the system. ..."
Abstract
- Add to MetaCart
We consider the problem of finding a basic solution to a system of linear constraints (in standard form) given a non-basic solution to the system.
Greedy Randomized Adaptive Search Procedures
, 2002
"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract
-
Cited by 647 (82 self)
- Add to MetaCart
GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search
The Semantics Of Constraint Logic Programs
- JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract
-
Cited by 872 (14 self)
- Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a self-contained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Mining Generalized Association Rules
, 1995
"... We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy th ..."
Abstract
-
Cited by 591 (7 self)
- Add to MetaCart
solution to the problem is to add all ancestors of each item in a transaction to the transaction, and then run any of the algorithms for mining association rules on these "extended transactions ". However, this "Basic" algorithm is not very fast; we present two algorithms, Cumulate
Multimodality Image Registration by Maximization of Mutual Information
- IEEE TRANSACTIONS ON MEDICAL IMAGING
, 1997
"... A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence or in ..."
Abstract
-
Cited by 791 (10 self)
- Add to MetaCart
A new approach to the problem of multimodality medical image registration is proposed, using a basic concept from information theory, mutual information (MI), or relative entropy, as a new matching criterion. The method presented in this paper applies MI to measure the statistical dependence
Trace Scheduling: A Technique for Global Microcode Compaction
- IEEE TRANSACTIONS ON COMPUTERS
, 1981
"... Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages int ..."
Abstract
-
Cited by 683 (5 self)
- Add to MetaCart
Microcode compaction is the conversion of sequential microcode into efficient parallel (horizontal) microcode. Local com-paction techniques are those whose domain is basic blocks of code, while global methods attack code with a general flow control. Compilation of high-level microcode languages
A Survey of Approaches to Automatic Schema Matching
- VLDB JOURNAL
, 2001
"... Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous ..."
Abstract
-
Cited by 1351 (51 self)
- Add to MetaCart
Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous
An Introduction to the Kalman Filter
- UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL
, 1995
"... In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area o ..."
Abstract
-
Cited by 1146 (13 self)
- Add to MetaCart
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discrete-data linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area
Results 1 - 10
of
14,153
