Sciweavers

2944 search results - page 404 / 589
» Improving Bound Propagation
Sort
View
DAGSTUHL
2007
15 years 8 months ago
Approximating min-max k-clustering
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
Asaf Levin
NIPS
2007
15 years 8 months ago
Collapsed Variational Inference for HDP
A wide variety of Dirichlet-multinomial ‘topic’ models have found interesting applications in recent years. While Gibbs sampling remains an important method of inference in su...
Yee Whye Teh, Kenichi Kurihara, Max Welling
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 8 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
RSS
2007
115views Robotics» more  RSS 2007»
15 years 8 months ago
An experimental study of exploiting multipath fading for robot communications
— A simple approach for mobile robots to exploit multipath fading in order to improve received radio signal strength (RSS), is presented. The strategy is to sample the RSS at dis...
Magnus Lindhé, Karl Henrik Johansson, Anton...
SBBD
2007
148views Database» more  SBBD 2007»
15 years 8 months ago
Bulk-loading Dynamic Metric Access Methods
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
Thiago Galbiatti Vespa, Caetano Traina Jr., Agma J...