2519 search results - page 489 / 504 » cost 2007 |
147
click to vote
SCALESPACE
2007
Springer
15 years 5 months ago
2007
Springer
Level set methods have been proven to be efficient tools for tracing interface problems. Recently, some variants of the Osher- Sethian level set methods, which are called the Piece...
156
click to vote
SSD
2007
Springer
15 years 5 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
111
click to vote
STACS
2007
Springer
15 years 5 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
112
click to vote
ICPR
2006
IEEE
15 years 5 months ago
2006
IEEE
Linear Discriminant Analysis (LDA) is a widely used technique for pattern classification. It seeks the linear projection of the data to a low dimensional subspace where the data ...
107
click to vote
KI
2004
Springer
15 years 5 months ago
2004
Springer
Abstract Recent progress in mobile broadband communication and semantic web technology is enabling innovative internet services that provide advanced personalization and localizati...