Sciweavers

720 search results - page 79 / 144
» Linear k-arboricities on trees
Sort
View
ICML
2006
IEEE
14 years 9 months ago
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem...
Pradeep D. Ravikumar, John D. Lafferty
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 2 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar
ACOM
2006
Springer
14 years 2 months ago
Temporal Logics for Representing Agent Communication Protocols
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
Ulle Endriss
ECCV
2004
Springer
14 years 2 months ago
Novelty Detection in Image Sequences with Dynamic Background
Abstract. We propose a new scheme for novelty detection in image sequences capable of handling non-stationary background scenarious, such as waving trees, rain and snow. Novelty de...
Fredrik Kahl, Richard I. Hartley, Volker Hilsenste...
HICSS
2003
IEEE
90views Biometrics» more  HICSS 2003»
14 years 2 months ago
A Prototype for Multiple Whole Genome Alignment
In this paper, we briefly describe a prototype of the software system we have developed for multiple whole genome alignment. To develop our algorithm, we have to solve several pr...
Jitender S. Deogun, Fangrui Ma, Jingyi Yang, Andre...