Sciweavers

712 search results - page 78 / 143
» cluster 2003
Sort
View
SODA
2003
ACM
126views Algorithms» more  SODA 2003»
15 years 1 months ago
Smaller core-sets for balls
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
Mihai Badoiu, Kenneth L. Clarkson
ISHPC
2003
Springer
15 years 5 months ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
133
Voted
NAACL
2003
15 years 1 months ago
Discriminating Among Word Senses Using McQuitty's Similarity Analysis
This paper presents an unsupervised method for discriminating among the senses of a given target word based on the context in which it occurs. Instances of a word that occur in si...
Amruta Purandare
94
Voted
ICIAP
2003
ACM
15 years 5 months ago
Color matching by using tuple matching
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Dirk Balthasar
89
Voted
NAACL
2003
15 years 1 months ago
Columbia's Newsblaster: New Features and Future Directions
Columbia’s Newsblaster tracking and summarization system is a robust system that clusters news into events, categorizes events into broad topics and summarizes multiple articles...
Kathleen McKeown, Regina Barzilay, John Chen, Davi...