Sciweavers

273 search results - page 1 / 55
» Mechanization for solving SPP by reducing order method
Sort
View
AMC
2005
112views more  AMC 2005»
13 years 4 months ago
Mechanization for solving SPP by reducing order method
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
Zhenqing Li, Weiming Wang
CVPR
2008
IEEE
14 years 6 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
CVPR
2006
IEEE
14 years 6 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
IJCAI
1989
13 years 5 months ago
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge
This paper highlights a phenomenon that causes deductively learned knowledge to be harmful when used for problem solving. The problem occurs when deductive problem solvers encount...
Shaul Markovitch, Paul D. Scott
FM
1991
Springer
164views Formal Methods» more  FM 1991»
13 years 8 months ago
Formalizing Design Spaces: Implicit Invocation Mechanisms
An important goal of software engineering is to exploit commonalities in system design in order to reduce the complexity of building new systems, support largescale reuse, and pro...
David Garlan, David Notkin