4491 search results - page 561 / 899 » Algorithm Engineering |
165
click to vote
FSTTCS
2003
Springer
15 years 11 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
138
click to vote
MSR
2010
ACM
15 years 11 months ago
2010
ACM
—In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in h...
192
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Previous works on automatic query clustering most generate a flat, un-nested partition of query terms. In this work, we are pursuing to organize query terms into a hierarchical s...
162
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
A new method, namely the Parallel Two-Level Hybrid (PTH) method, is developed to solve tridiagonal systems on parallel computers. PTH is designed based on Parallel Diagonal Domina...
160
click to vote
ECOOP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. The use of spreadsheets to capture information is widespread in industry. Spreadsheets can thus be a wealthy source of domain information. We propose to automatically ext...