Sciweavers

1477 search results - page 50 / 296
» On Graph Problems in a Semi-streaming Model
Sort
View
AAAI
2006
15 years 2 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
CVPR
2009
IEEE
16 years 8 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
IBPRIA
2007
Springer
15 years 7 months ago
Locating and Segmenting 3D Deformable Objects by Using Clusters of Contour Fragments
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
Manuel J. Marín-Jiménez, Nicolas P&e...
ESA
2004
Springer
97views Algorithms» more  ESA 2004»
15 years 6 months ago
Radio Network Clustering from Scratch
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
ATMOS
2010
150views Optimization» more  ATMOS 2010»
15 years 12 days ago
Dynamic Graph Generation and Dynamic Rolling Horizon Techniques in Large Scale Train Timetabling
The aim of the train timetabling problem is to find a conflict free timetable for a set of passenger and freight trains along their routes in an infrastructure network. Several ...
Frank Fischer, Christoph Helmberg