Sciweavers

1091 search results - page 167 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
IROS
2008
IEEE
180views Robotics» more  IROS 2008»
14 years 2 months ago
Aligning point cloud views using persistent feature histograms
— In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collect...
Radu Bogdan Rusu, Nico Blodow, Zoltan Csaba Marton...
ICML
2008
IEEE
14 years 9 months ago
Active kernel learning
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A variety of kernel learning algorithms have been prop...
Steven C. H. Hoi, Rong Jin
SDM
2009
SIAM
220views Data Mining» more  SDM 2009»
14 years 5 months ago
Bayesian Cluster Ensembles.
Cluster ensembles provide a framework for combining multiple base clusterings of a dataset to generate a stable and robust consensus clustering. There are important variants of th...
Hongjun Wang, Hanhuai Shan, Arindam Banerjee
TON
2008
125views more  TON 2008»
13 years 8 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
ANOR
2010
130views more  ANOR 2010»
13 years 5 months ago
Greedy scheduling with custom-made objectives
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...
Carsten Franke, Joachim Lepping, Uwe Schwiegelshoh...