348 search results - page 38 / 70 » Distributed Approximation Algorithm for Resource Clustering |
123
click to vote
EMNLP
2009
15 years 45 min ago
2009
We report in this paper a way of doing Word Sense Disambiguation (WSD) that has its origin in multilingual MT and that is cognizant of the fact that parallel corpora, wordnets and...
146
Voted
EURODAC
1995
IEEE
15 years 5 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
134
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
105
Voted
AAAI
2010
15 years 7 days ago
2010
Different solvers for computationally difficult problems such as satisfiability (SAT) perform best on different instances. Algorithm portfolios exploit this phenomenon by predicti...
85
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...