701 search results - page 57 / 141 » Costs Are Expensive! |
88
Voted
GECCO
2004
Springer
15 years 4 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
109
click to vote
PR
2011
14 years 6 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
112
click to vote
IPPS
1999
IEEE
15 years 3 months ago
1999
IEEE
Using off-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. A choice of a cost-effective cluster computing platform ...
188
click to vote
SIGMOD
2009
ACM
15 years 11 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
97
Voted
EDBT
2004
ACM
15 years 11 months ago
2004
ACM
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...