Sciweavers

8437 search results - page 456 / 1688
» Preferences over Sets
Sort
View
ACL
2006
15 years 8 months ago
Automatic Learning of Textual Entailments with Cross-Pair Similarities
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to ...
Fabio Massimo Zanzotto, Alessandro Moschitti
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
15 years 7 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
ENTCS
2008
120views more  ENTCS 2008»
15 years 7 months ago
Complementarity of Error Detection Techniques
We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to fin...
Radek Pelánek, Václav Rosecký...
ENTCS
2006
100views more  ENTCS 2006»
15 years 6 months ago
Functors Determined by Values on Objects
Functors which are determined, up to natural isomorphism, by their values on objects, are called DVO (Defined by Values on Objects). We focus on the collection of polynomial funct...
Daniela Cancila, Furio Honsell, Marina Lenisa
FOCM
2002
97views more  FOCM 2002»
15 years 6 months ago
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods
We consider the Riemannian geometry defined on a convex set by the Hessian of a selfconcordant barrier function, and its associated geodesic curves. These provide guidance for the...
Yu. E. Nesterov, Michael J. Todd