Results 1  10
of
470
Large margin methods for structured and interdependent output variables
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2005
"... Learning general functional dependencies between arbitrary input and output spaces is one of the key challenges in computational intelligence. While recent progress in machine learning has mainly focused on designing flexible and powerful input representations, this paper addresses the complementary ..."
Abstract

Cited by 624 (12 self)
 Add to MetaCart
to accomplish this, we propose to appropriately generalize the wellknown notion of a separation margin and derive a corresponding maximummargin formulation. While this leads to a quadratic program with a potentially prohibitive, i.e. exponential, number of constraints, we present a cutting plane algorithm
Languages That Capture Complexity Classes
 SIAM Journal of Computing
, 1987
"... this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first ..."
Abstract

Cited by 245 (21 self)
 Add to MetaCart
order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach
A deterministic subexponential algorithm for solving parity games
 SODA
, 2006
"... The existence of polynomial time algorithms for the solution of parity games is a major open problem. The fastest known algorithms for the problem are randomized algorithms that run in subexponential time. These algorithms are all ultimately based on the randomized subexponential simplex algorithms ..."
Abstract

Cited by 80 (3 self)
 Add to MetaCart
of Kalai and of Matousek, Sharir and Welzl. Randomness seems to play an essential role in these algorithms. We use a completely different, and elementary, approach to obtain a deterministic subexponential algorithm for the solution of parity games. The new algorithm, like the existing randomized
How to meet asynchronously at polynomial cost
 Proc. 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013
"... Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a positive integer known to it, but unknown to the other agent. Agents move in an asynchronous way: the speed of agents may ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
present a deterministic rendezvous algorithm with cost polynomial in the size of the graph and in the length of the smaller label. Hence we decrease the cost exponentially in the size of the graph and doubly exponentially in the labels of agents. As an application of our rendezvous algorithm we solve
Unfolding Synthesis of Asynchronous Automata
 International Computer Science Symposium in Russia, CSR 2006. Available at http://www.cmi.univmrs.fr/˜morin/papers/CSR.pdf
"... Abstract. Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a nondeterministic asynch ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Zielonka’s theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a nondeterministic
Set KCover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks
 In Proceedings of IPSN’04
, 2004
"... Wireless sensor networks (WSNs) are emerging as an e#ective means for environment monitoring. This paper investigates a strategy for energy e#cient monitoring in WSNs that partitions the sensors into covers, and then activates the covers iteratively in a roundrobin fashion. This approach takes adva ..."
Abstract

Cited by 129 (0 self)
 Add to MetaCart
such that the number of covers that include an area, summed over all areas, is maximized. The first algorithm is randomized and partitions the sensors, in expectation, within a fraction 1 e (#.63) of the optimum. We present two other deterministic approximation algorithms. One is a distributed greedy algorithm
Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring
, 2004
"... We address one of the most fundamental problems concerning the RSA cryptoscheme: Does the knowledge of the RSA public key/ secret key pair (e, d) yield the factorization of N = pq in polynomial time? It is wellknown that there is a probabilistic polynomial time algorithm that on input (N, e, d) ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
) outputs the factors p and q. We present the first deterministic polynomial time algorithm that factors N provided that e, d #(N) and that the factors p, q are of the same bitsize. Our approach is an application of Coppersmith's technique for finding small roots of bivariate integer polynomials.
ArbitraryNorm Separating Plane
 Operations Research Letters
, 1997
"... A plane separating two point sets in ndimensional real space is constructed such that it minimizes the sum of arbitrarynorm distances of misclassified points to the plane. In contrast to previous approaches that used surrogates for distanceminimization, the present work is based on a precise norm ..."
Abstract

Cited by 53 (13 self)
 Add to MetaCart
A plane separating two point sets in ndimensional real space is constructed such that it minimizes the sum of arbitrarynorm distances of misclassified points to the plane. In contrast to previous approaches that used surrogates for distanceminimization, the present work is based on a precise
Deterministic PolynomialTime Equivalence of Computing the RSA Secret Key and Factoring
, 2006
"... Abstract. We address one of the most fundamental problems concerning the RSA cryptosystem: does the knowledge of the RSA public and secret key pair (e, d) yield the factorization of N = pq in polynomial time? It is well known that there is a probabilistic polynomialtime algorithm that on input (N, ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
, e, d) outputs the factors p and q. We present the first deterministic polynomialtime algorithm that factors N given (e, d) provided that e, d <ϕ(N). Our approach is an application of Coppersmith’s technique for finding small roots of univariate modular polynomials. Key words. RSA, Coppersmith’s
Results 1  10
of
470