Sciweavers

10055 search results - page 205 / 2011
» Structured programming using processes
Sort
View
MST
2007
154views more  MST 2007»
13 years 10 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 10 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
SCS
2004
13 years 11 months ago
The HEAT/ACT Preliminary Safety Case: A case study in the use of Goal Structuring Notation
The HEAT/ACT project consists of replacing the conventional mechanical flight control system of a helicopter with a fly-by-wire system. With such a project, the safety concerns ar...
Paul Chinneck, David Pumfrey, John McDermid
SRDS
2006
IEEE
14 years 4 months ago
Solving Consensus Using Structural Failure Models
Failure models characterise the expected component failures in fault-tolerant computing. In the context of distributed systems, a failure model usually consists of two parts: a fu...
Timo Warns, Felix C. Freiling, Wilhelm Hasselbring
CVPR
2010
IEEE
14 years 6 months ago
Tiered Scene Labeling with Dynamic Programming
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low tre...
Pedro Felzenszwalb, Olga Veksler