Sciweavers

1787 search results - page 245 / 358
» Approximation Techniques for Spatial Data
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
14 years 4 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
PKDD
2009
Springer
148views Data Mining» more  PKDD 2009»
14 years 4 months ago
Feature Selection by Transfer Learning with Linear Regularized Models
Abstract. This paper presents a novel feature selection method for classification of high dimensional data, such as those produced by microarrays. It includes a partial supervisio...
Thibault Helleputte, Pierre Dupont
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 10 months ago
Distributed Principal Component Analysis for Wireless Sensor Networks
Abstract: The Principal Component Analysis (PCA) is a data dimensionality reduction technique well-suited for processing data from sensor networks. It can be applied to tasks like ...
Yann-Aël Le Borgne, Sylvain Raybaud, Gianluca...
JGTOOLS
2008
126views more  JGTOOLS 2008»
13 years 10 months ago
Simple Empty-Space Removal for Interactive Volume Rendering
Interactive volume rendering methods such as texture-based slicing techniques and ray-casting have been well developed in recent years. The rendering performance is generally restr...
Vincent Vidal 0002, Xing Mei, Philippe Decaudin
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
14 years 4 months ago
Scalable SLAM building conditionally independent local maps
— Local maps algorithms have demonstrated to be well suited for mapping large environments as can reduce the computational cost and improve the consistency of the final estimati...
Pedro Pinies, Juan D. Tardós