12289 search results - page 698 / 2458 » computing 2006 |
185
click to vote
MP
1998
15 years 7 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
197
Voted
IJPP
2010
15 years 5 months ago
2010
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
227
Voted
NA
2010
15 years 5 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
197
Voted
PAMI
2010
15 years 5 months ago
2010
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...
187
click to vote
ESA
2006
Springer
15 years 11 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...