Sciweavers

2826 search results - page 528 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
COR
2006
140views more  COR 2006»
14 years 9 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
TASLP
2002
84views more  TASLP 2002»
14 years 9 months ago
Maximum likelihood multiple subspace projections for hidden Markov models
The first stage in many pattern recognition tasks is to generate a good set of features from the observed data. Usually, only a single feature space is used. However, in some compl...
Mark J. F. Gales
PR
2007
293views more  PR 2007»
14 years 9 months ago
Mean shift-based clustering
In this paper, a mean shift-based clustering algorithm is proposed. The mean shift is a kernel-type weighted mean procedure. Herein, we first discuss three classes of Gaussian, C...
Kuo-Lung Wu, Miin-Shen Yang
PRESENCE
2007
156views more  PRESENCE 2007»
14 years 9 months ago
ATLAS: A Scalable Network Framework for Distributed Virtual Environments
A distributed virtual environment (DVE) is a software system that allows users on a network to interact with each other by sharing a common view of their states. As users are geog...
Dongman Lee, Mingyu Lim, Seunghyun Han, Kyungmin L...
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 4 months ago
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...