1688 search results - page 255 / 338 » The Complexity of Rationalizing Matchings |
KDD
2002
ACM
15 years 11 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
KDD
2002
ACM
15 years 11 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...
100
click to vote
HPCA
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
107
click to vote
CHI
2004
ACM
15 years 11 months ago
2004
ACM
We present an image guided pen-based suggestive interface for sketching 3D wireframe models. Rather than starting from a blank canvas, existing 2D images of similar objects serve ...
STOC
2005
ACM
15 years 11 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...