Sciweavers

1722 search results - page 223 / 345
» On the sample mean of graphs
Sort
View
ICPR
2002
IEEE
16 years 7 months ago
A Windowed Weighted Approach for Approximate Cyclic String Matching
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...
Ramón Alberto Mollineda, Enrique Vidal, Fra...
CVPR
2010
IEEE
1171views Computer Vision» more  CVPR 2010»
16 years 3 months ago
Geodesic Star Convexity for Interactive Image Segmentation
In this paper we introduce a new shape constraint for interactive image segmentation. It is an extension of Veksler's star-convexity prior, in two ways: from a single star to ...
Varun Gulshan, Carsten Rother, Antonio Criminisi, ...
STACS
2010
Springer
16 years 1 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
CEC
2009
IEEE
16 years 1 months ago
Representation and structural biases in CGP
— An evolutionary algorithm automatically discovers suitable solutions to a problem, which may lie anywhere in a large search space of candidate solutions. In the case of Genetic...
Andrew J. Payne, Susan Stepney
IROS
2007
IEEE
148views Robotics» more  IROS 2007»
16 years 20 days ago
Tractable probabilistic models for intention recognition based on expert knowledge
— Intention recognition is an important topic in human-robot cooperation that can be tackled using probabilistic model-based methods. A popular instance of such methods are Bayes...
Oliver C. Schrempf, David Albrecht, Uwe D. Hanebec...