7006 search results - page 462 / 1402 » Approximation Algorithms |
160
click to vote
ADBIS
1994
Springer
15 years 9 months ago
1994
Springer
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
134
click to vote
AOR
2007
15 years 5 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
144
click to vote
TSP
2008
15 years 5 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...
179
click to vote
CGO
2011
IEEE
14 years 9 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
134
click to vote
DSMML
2004
Springer
15 years 8 months ago
2004
Springer
We investigate theoretically some properties of variational Bayes approximations based on estimating the mixing coefficients of known densities. We show that, with probability 1 a...