Sciweavers

145 search results - page 26 / 29
» Front Representation of Set Partitions
Sort
View
PRL
2006
139views more  PRL 2006»
13 years 7 months ago
Adaptive Hausdorff distances and dynamic clustering of symbolic interval data
This paper presents a partitional dynamic clustering method for interval data based on adaptive Hausdorff distances. Dynamic clustering algorithms are iterative two-step relocatio...
Francisco de A. T. de Carvalho, Renata M. C. R. de...
PRL
2006
105views more  PRL 2006»
13 years 7 months ago
Parisian camera placement for vision metrology
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Enrique Dunn, Gustavo Olague, Evelyne Lutton
DCG
2002
66views more  DCG 2002»
13 years 7 months ago
Generation of Oriented Matroids - A Graph Theoretical Approach
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...
Lukas Finschi, Komei Fukuda
ICRA
2010
IEEE
88views Robotics» more  ICRA 2010»
13 years 6 months ago
Relaxed optimization for mode estimation in skid steering
— Skid-steered vehicles, by design, must skid in order to maneuver. The skidding causes the vehicle to behave discontinuously as well as introduces complications to the observati...
Timothy M. Caldwell, Todd D. Murphey
BIOINFORMATICS
2011
12 years 11 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....