Results 1 - 10
of
3,676
Color indexing
- International Journal of Computer Vision
, 1991
"... Computer vision is embracing a new research focus in which the aim is to develop visual skills for robots that allow them to interact with a dynamic, realistic environment. To achieve this aim, new kinds of vision algorithms need to be developed which run in real time and subserve the robot's g ..."
Abstract
-
Cited by 1636 (26 self)
- Add to MetaCart
Computer vision is embracing a new research focus in which the aim is to develop visual skills for robots that allow them to interact with a dynamic, realistic environment. To achieve this aim, new kinds of vision algorithms need to be developed which run in real time and subserve the robot
Differential Evolution - A simple and efficient adaptive scheme for global optimization over continuous spaces
, 1995
"... A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simula ..."
Abstract
-
Cited by 427 (5 self)
- Add to MetaCart
A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive
How to break MD5 and other hash functions
- In EUROCRYPT
, 2005
"... Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi free-start collision, in which the initial value of the has ..."
Abstract
-
Cited by 317 (7 self)
- Add to MetaCart
of the hash function is replaced by a non-standard value, which is the result of the attack. In this paper we present a new powerful attack on MD5 which allows us to find collisions efficiently. We used this attack to find collisions of MD5 in about 15 minutes up to an hour computation time. The attack is a
A Multiscale Finite Element Method For Elliptic Problems In Composite Materials And Porous Media
- JOURNAL OF COMPUTATIONAL PHYSICS
, 1997
"... In this paper, we study a multiscale finite element method for solving a class of elliptic problems arising from composite materials and flows in porous media, which contain many spatial scales. The method is designed to efficiently capture the large scale behavior of the solution without resolving ..."
Abstract
-
Cited by 312 (27 self)
- Add to MetaCart
In this paper, we study a multiscale finite element method for solving a class of elliptic problems arising from composite materials and flows in porous media, which contain many spatial scales. The method is designed to efficiently capture the large scale behavior of the solution without
Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations
, 2008
"... ... reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial differential equations. The essential ingredients are (primal-dual) Galerkin projection onto a low-dimensional space associated with a smooth “parametric ..."
Abstract
-
Cited by 204 (37 self)
- Add to MetaCart
... reduced basis approximation and a posteriori error estimation for linear functional outputs of affinely parametrized elliptic coercive partial differential equations. The essential ingredients are (primal-dual) Galerkin projection onto a low-dimensional space associated with a smooth
A learning theory approach to non-interactive database privacy
- In Proceedings of the 40th annual ACM symposium on Theory of computing
, 2008
"... In this paper we demonstrate that, ignoring computational constraints, it is possible to release synthetic databases that are useful for accurately answering large classes of queries while preserving differential privacy. Specifically, we give a mechanism that privately releases synthetic data usefu ..."
Abstract
-
Cited by 220 (25 self)
- Add to MetaCart
In this paper we demonstrate that, ignoring computational constraints, it is possible to release synthetic databases that are useful for accurately answering large classes of queries while preserving differential privacy. Specifically, we give a mechanism that privately releases synthetic data
High-Order Collocation Methods for Differential Equations with Random Inputs
- SIAM Journal on Scientific Computing
"... Abstract. Recently there has been a growing interest in designing efficient methods for the so-lution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling met ..."
Abstract
-
Cited by 188 (13 self)
- Add to MetaCart
Abstract. Recently there has been a growing interest in designing efficient methods for the so-lution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling
Modeling the Motion of a Hot, Turbulent Gas
, 1997
"... This paper describes a new animation technique for modeling the turbulent rotational motion that occurs when a hot gas interacts with solid objects and the surrounding medium. The method is especially useful for scenes involving swirling steam, rolling or billowing smoke, and gusting wind. It can al ..."
Abstract
-
Cited by 197 (2 self)
- Add to MetaCart
also model gas motion due to fans and heat convection. The method combines specialized forms of the equations of motion of a hot gas with an efficient method for solving volumetric differential equations at low resolutions. Particular emphasis is given to issues of computational efficiency and ease
A level-set approach to 3d reconstruction from range data
- International Journal of Computer Vision
, 1998
"... This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a statistical problem: find that surface which is mostly likely, given the data and some prior knowledge about the application d ..."
Abstract
-
Cited by 195 (24 self)
- Add to MetaCart
presents a novel computational technique for level-set modeling, called the sparse-field algorithm, which combines the advantages of a level-set approach with the computational efficiency and accuracy of a parametric representation. The sparse-field algorithm is more efficient than other approaches
An algorithm for differential file comparison. Computer Science
, 1975
"... The program diff reports differences between two files, expressed as a minimal list of line changes to bring either file into agreement with the other. Diff has been engineered to make efficient use of time and space on typical inputs that arise in vetting version-to-version changes in computer-main ..."
Abstract
-
Cited by 141 (3 self)
- Add to MetaCart
The program diff reports differences between two files, expressed as a minimal list of line changes to bring either file into agreement with the other. Diff has been engineered to make efficient use of time and space on typical inputs that arise in vetting version-to-version changes in computer
Results 1 - 10
of
3,676