Sciweavers

JMLR
2010
108views more  JMLR 2010»
13 years 3 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
NN
2002
Springer
226views Neural Networks» more  NN 2002»
13 years 8 months ago
Data visualisation and manifold mapping using the ViSOM
The self-organising map (SOM) has been successfully employed as a nonparametric method for dimensionality reduction and data visualisation. However, for visualisation the SOM requ...
Hujun Yin
JMIV
2008
121views more  JMIV 2008»
13 years 8 months ago
A Geometric Approach for Regularization of the Data Term in Stereo-Vision
Every stereovision application must cope with the correspondence problem. The space of the matching variables, often consisting of spatial coordinates, intensity and disparity, is...
Rami Ben-Ari, Nir A. Sochen
COORDINATION
2008
Springer
13 years 10 months ago
Encrypted Shared Data Spaces
Abstract. The deployment of Share Data Spaces in open, possibly hostile, environments arises the need of protecting the confidentiality of the data space content. Existing approach...
Giovanni Russello, Changyu Dong, Naranker Dulay, M...
SIGMOD
1998
ACM
117views Database» more  SIGMOD 1998»
14 years 22 days ago
The Pyramid-Technique: Towards Breaking the Curse of Dimensionality
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
ECCV
2000
Springer
14 years 26 days ago
Factorization with Uncertainty
Factorization using Singular Value Decomposition (SVD) is often used for recovering 3D shape and motion from feature correspondences across multiple views. SVD is powerful at find...
Michal Irani, P. Anandan
SSPR
2004
Springer
14 years 1 months ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli
EUROPAR
2004
Springer
14 years 1 months ago
Exploiting Differentiated Tuple Distribution in Shared Data Spaces
The shared data space model has proven to be an effective paradigm for building distributed applications. However, building an efficient distributed implementation remains a chall...
Giovanni Russello, Michel R. V. Chaudron, Maarten ...
MOBIDE
2005
ACM
14 years 2 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
EUROPAR
2007
Springer
14 years 2 months ago
A Structured Overlay for Multi-dimensional Range Queries
Abstract. We introduce SONAR, a structured overlay to store and retrieve objects addressed by multi-dimensional names (keys). The overlay has the shape of a multi-dimensional torus...
Thorsten Schütt, Florian Schintke, Alexander ...