Sciweavers

962 search results - page 49 / 193
» Some Reducibilities on Regular Sets
Sort
View
JGAA
2006
83views more  JGAA 2006»
13 years 7 months ago
On the approximation of Min Split-coloring and Min Cocoloring
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...
Marc Demange, Tinaz Ekim, Dominique de Werra
ECCV
2002
Springer
14 years 9 months ago
Finding the Largest Unambiguous Component of Stereo Matching
Abstract. Stereo matching is an ill-posed problem for at least two principal reasons: (1) because of the random nature of match similarity measure and (2) because of structural amb...
Radim Sára
RTCSA
1998
IEEE
13 years 12 months ago
Protocol Synthesis from Context-Free Processes Using Event Structures
In this paper, we propose a protocol synthesis method based on a partial order model (called event structures) for the class of context-free processes. First, we assign a unique n...
Akio Nakata, Teruo Higashino, Kenichi Taniguchi
IJFCS
2008
158views more  IJFCS 2008»
13 years 7 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth
JMLR
2010
143views more  JMLR 2010»
13 years 6 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...