Sciweavers

1133 search results - page 173 / 227
» Basics of Graph Cuts
Sort
View
CVPR
2012
IEEE
12 years 14 days ago
Multi view registration for novelty/background separation
We propose a system for the automatic segmentation of novelties from the background in scenarios where multiple images of the same environment are available e.g. obtained by weara...
Omid Aghazadeh, Josephine Sullivan, Stefan Carlsso...
IANDC
2008
141views more  IANDC 2008»
13 years 10 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
EUROGP
2001
Springer
106views Optimization» more  EUROGP 2001»
14 years 2 months ago
Linear-Tree GP and Its Comparison with Other GP Structures
Abstract. In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph stru...
Wolfgang Kantschik, Wolfgang Banzhaf
DIAGRAMS
2000
Springer
14 years 2 months ago
Universal Arrow Foundations for Visual Modeling
The goal of the paper is to explicate some common formal logic underlying various notational systems used in visual modeling. The idea is to treat the notational diversity as the d...
Zinovy Diskin, Boris Kadish, Frank Piessens, Micha...
APN
2006
Springer
14 years 1 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin