1492 search results - page 27 / 299 » Geometric Clustering Using the Information Bottleneck Method |
GRID
2005
Springer
15 years 3 months ago
2005
Springer
— In a grid-computing environment, resource selection and scheduling depend on the network topology connecting the computation nodes. This paper presents a method to hierarchical...
106
click to vote
SIAMIS
2010
14 years 8 months ago
2010
Abstract. In this work, we present an approach to jointly segment a rigid object in a two-dimensional (2D) image and estimate its three-dimensional (3D) pose, using the knowledge o...
ECIR
2004
Springer
14 years 11 months ago
2004
Springer
We simulate different architectures of a distributed Information Retrieval system on a very large Web collection, in order to work out the optimal setting for a particular set of r...
COLING
2008
14 years 11 months ago
2008
Supervised approaches to Word Sense Disambiguation (WSD) have been shown to outperform other approaches but are hampered by reliance on labeled training examples (the data acquisi...
CORR
2010
Springer
14 years 4 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...