Sciweavers

1149 search results - page 220 / 230
» Minimally non-Pfaffian graphs
Sort
View
AAAI
1994
13 years 8 months ago
Improving Repair-Based Constraint Satisfaction Methods by Value Propagation
A constraint satisfaction problem (CSP) is a problem to find an assignment that satisfies given constraints. An interesting approach to CSP is a repair-based method that first gen...
Nobuhiro Yugami, Yuiko Ohta, Hirotaka Hara
IJCAI
1993
13 years 8 months ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
ISMB
1994
13 years 8 months ago
Representations of Metabolic Knowledge: Pathways
The automatic generation of drawings of metabolic pathways is a challenging problem that depends intimately on exactly what information has been recorded for each pathway, and on ...
Peter D. Karp, Suzanne M. Paley
CVPR
2010
IEEE
13 years 8 months ago
Player Localization Using Multiple Static Cameras for Sports Visualization
We present a novel approach for robust localization of multiple people observed using multiple cameras. We use this location information to generate sports visualizations, which i...
Raffay Hamid, Ramkrishan Kumar, Matthias Grundmann...
ECCV
2010
Springer
13 years 7 months ago
Segmenting Salient Objects from Images and Videos
Abstract. In this paper we introduce a new salient object segmentation method, which is based on combining a saliency measure with a conditional random field (CRF) model. The propo...
Esa Rahtu, Juho Kannala, Mikko Salo, Janne Heikkil...