860 search results - page 96 / 172 » Lower Bounds on the Size of Test Data Sets |
ICALP
2010
Springer
14 years 19 days ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
SIGIR
1992
ACM
13 years 12 months ago
1992
ACM
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
SIGGRAPH
2000
ACM
14 years 6 days ago
2000
ACM
Advances in 3D scanning technologies have enabled the practical creation of meshes with hundreds of millions of polygons. Traditional algorithms for display, simplification, and ...
NIPS
2003
13 years 9 months ago
2003
Label ranking is the task of inferring a total order over a predefined set of labels for each given instance. We present a general framework for batch learning of label ranking f...
PKC
2009
Springer
14 years 8 months ago
2009
Springer
Network coding offers increased throughput and improved robustness to random faults in completely decentralized networks. In contrast to traditional routing schemes, however, netw...