231 search results - page 4 / 47 » Computational experience with exterior point algorithms for ... |
JPDC
2007
13 years 6 months ago
2007
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
SIAMJO
2000
13 years 6 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
SSD
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
MM
2004
ACM
14 years 3 days ago
2004
ACM
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database...
PEWASUN
2006
ACM
14 years 19 days ago
2006
ACM
Many previous papers have pointed out that TCP performance in multi-hop ad hoc networks is not optimal. This is due to several TCP design principles that reflect the characteristi...