Sciweavers

25 search results - page 3 / 5
» Approximation Algorithms for the Loop Cutset Problem
Sort
View
IMR
2005
Springer
13 years 11 months ago
A fews snags in mesh adaptation loops
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
Frédéric Hecht
CVPR
2009
IEEE
15 years 27 days ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
ADAEUROPE
2007
Springer
13 years 12 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...
ICML
2003
IEEE
14 years 6 months ago
Modified Logistic Regression: An Approximation to SVM and Its Applications in Large-Scale Text Categorization
Logistic Regression (LR) has been widely used in statistics for many years, and has received extensive study in machine learning community recently due to its close relations to S...
Jian Zhang, Rong Jin, Yiming Yang, Alexander G. Ha...
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 4 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...