3415 search results - page 428 / 683 » Lower bounds on kernelization |
180
click to vote
NIPS
2001
15 years 8 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
167
click to vote
IJCAI
2003
15 years 8 months ago
2003
Often the most expensive and time-consuming task in building a pattern recognition system is col lecting and accurately labeling training and testing data. In this paper, we exp...
140
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
192
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
149
click to vote
WSC
2001
15 years 8 months ago
2001
This paper presents a new approach to pricing Americanstyle derivatives. By approximating the value function with a piecewise linear interpolation function, the option holder'...