Sciweavers

1871 search results - page 295 / 375
» The Ephemeral Pairing Problem
Sort
View
JGAA
2007
135views more  JGAA 2007»
15 years 6 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
TROB
2008
105views more  TROB 2008»
15 years 6 months ago
Robot-to-Robot Relative Pose Estimation From Range Measurements
In this paper, we address the problem of determining the 2D relative pose of pairs of communicating robots from (i) robot-to-robot distance measurements and (ii) displacement estim...
Xun S. Zhou, Stergios I. Roumeliotis
TVCG
2008
163views more  TVCG 2008»
15 years 6 months ago
An Efficient Naturalness-Preserving Image-Recoloring Method for Dichromats
We present an efficient and automatic image-recoloring technique for dichromats that highlights important visual details that would otherwise be unnoticed by these individuals. Whi...
Giovane R. Kuhn, Manuel M. Oliveira, Leandro A. F....
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
The Hausdorff Voronoi Diagram of Point Clusters in the Plane
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
Evanthia Papadopoulou
LOGCOM
2007
97views more  LOGCOM 2007»
15 years 6 months ago
A General Framework for Expressing Preferences in Causal Reasoning and Planning
We consider the problem of incorporating arbitrary preferences in planning systems. A preference may be seen as a goal or constraint that is desirable, but not necessary, to satis...
James P. Delgrande, Torsten Schaub, Hans Tompits