458 search results - page 51 / 92 » Linear Time Algorithms for Clustering Problems in Any Dimens... |
148
Voted
DSMML
2004
Springer
15 years 9 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
112
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
131
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
148
click to vote
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
117
click to vote
JPDC
2008
15 years 3 months ago
2008
Let P be a polygonal region which is forbidden for placing a base station in the context of mobile communication. Our objective is to place one base station at any point on the bo...