Sciweavers

81 search results - page 5 / 17
» Even Faster Algorithm for Set Splitting!
Sort
View
FOCS
2008
IEEE
13 years 8 months ago
Set Covering with our Eyes Closed
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi,...
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 8 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
TVCG
1998
194views more  TVCG 1998»
13 years 6 months ago
Multiresolution Analysis on Irregular Surface Meshes
Wavelet-based methods have proven their efficiency for the visualization at different levels of detail, progressive transmission, and compression of large data sets. The required...
Georges-Pierre Bonneau
ICIP
2006
IEEE
14 years 8 months ago
Stereo Tracking and Three-Point/One-Point Algorithms - A Robust Approach in Visual Odometry
In this paper, we present an approach of calculating visual odometry for outdoor robots equipped with a stereo rig. Instead of the typical feature matching or tracking, we use an ...
Kai Ni, Frank Dellaert
EDBT
1998
ACM
155views Database» more  EDBT 1998»
13 years 11 months ago
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations
Abstract. In this paper, we propose a new bulk-loading technique for high-dimensional indexes which represent an important component of multimedia database systems. Since it is ver...
Stefan Berchtold, Christian Böhm, Hans-Peter ...