Sciweavers

21319 search results - page 83 / 4264
» An Approach for Method Reengineering
Sort
View
CDC
2009
IEEE
166views Control Systems» more  CDC 2009»
15 years 2 months ago
Idempotent method for dynamic games and complexity reduction in min-max expansions
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
William M. McEneaney
LREC
2010
202views Education» more  LREC 2010»
14 years 11 months ago
United we Stand: Improving Sentiment Analysis by Joining Machine Learning and Rule Based Methods
In the past, we have succesfully used machine learning approaches for sentiment analysis. In the course of those experiments, we observed that our machine learning method, althoug...
Vassiliki Rentoumi, Stefanos Petrakis, Manfred Kle...
IPCO
2008
221views Optimization» more  IPCO 2008»
14 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
COLING
2002
14 years 9 months ago
A Novel Disambiguation Method for Unification-Based Grammars Using Probabilistic Context-Free Approximations
We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side...
Bernd Kiefer, Hans-Ulrich Krieger, Detlef Prescher
ICCV
2007
IEEE
15 years 12 months ago
Uninitialized, Globally Optimal, Graph-Based Rectilinear Shape Segmentation The Opposing Metrics Method
We present a new approach for the incorporation of shape information into a segmentation algorithm. Unlike previous approaches to the problem, our method requires no initializatio...
Ali Kemal Sinop, Leo Grady