16666 search results - page 2872 / 3334 » Descriptive and Computational Complexity |
188
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
201
Voted
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We present a new (1 + ε)-spanner for sets of n points in Rd . Our spanner has size O(n/εd−1 ) and maximum degree O(logd n). The main advantage of our spanner is that it can be...
145
click to vote
EICS
2009
ACM
15 years 11 months ago
2009
ACM
As user interfaces become more and more complex and feature laden, usability tends to decrease. One possibility to counter this effect are intelligent support mechanisms. In this ...
205
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
191
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...