Sciweavers

2489 search results - page 266 / 498
» On the Subgroup Distance Problem
Sort
View
COMSWARE
2006
IEEE
15 years 10 months ago
Spread-based heuristic for sensor selection in sensor networks
In this paper we propose a method for selecting an appropriate subset of sensors with a view to minimize estimation error while tracking a target with sensors spread across in a 2...
Vaishali P. Sadaphal, Bijendra N. Jain
CVPR
2006
IEEE
15 years 10 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
ICCS
2005
Springer
15 years 10 months ago
Towards a Bayesian Approach to Robust Finding Correspondences in Multiple View Geometry Environments
Abstract. This paper presents a new Bayesian approach to the problem of finding correspondences of moving objects in a multiple calibrated camera environment. Moving objects are d...
Cristian Canton-Ferrer, Josep R. Casas, Montse Par...
ISMIR
2005
Springer
154views Music» more  ISMIR 2005»
15 years 10 months ago
Exploiting the Tradeoff Between Precision and Cpu-Time to Speed Up Nearest Neighbor Search
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
Pierre Roy, Jean-Julien Aucouturier, Franço...
IMC
2003
ACM
15 years 9 months ago
Virtual landmarks for the internet
Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such a scheme, each host is assigned...
Liying Tang, Mark Crovella