Sciweavers

2489 search results - page 240 / 498
» On the Subgroup Distance Problem
Sort
View
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
15 years 10 months ago
A Proof for the Approximate Sparsity of SLAM Information Matrices
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
Udo Frese
INFOCOM
2005
IEEE
15 years 10 months ago
Secure positioning of wireless devices with application to sensor networks
Abstract— So far, the problem of positioning in wireless networks has been mainly studied in a non-adversarial setting. In this work, we analyze the resistance of positioning tec...
Srdjan Capkun, Jean-Pierre Hubaux
WIRN
2005
Springer
15 years 10 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
SPIRE
2004
Springer
15 years 10 months ago
Dealing with Syntactic Variation Through a Locality-Based Approach
To date, attempts for applying syntactic information in the document-based retrieval model dominant have led to little practical improvement, mainly due to the problems associated ...
Jesús Vilares Ferro, Miguel A. Alonso
WG
2004
Springer
15 years 10 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano