6110 search results - page 91 / 1222 » Approximate Computing |
158
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
146
click to vote
SIBGRAPI
2003
IEEE
15 years 11 months ago
2003
IEEE
A physically-based deformable model proposed by Terzopoulous et al. is governed by the Lagrange’s form, that establishes the relation between the dynamics of deformable models un...
204
click to vote
MFCS
2001
Springer
15 years 10 months ago
2001
Springer
We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400. The reduction i...
148
click to vote
DSN
2009
IEEE
16 years 29 days ago
2009
IEEE
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
200
click to vote
PDCAT
2005
Springer
15 years 11 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...