Sciweavers

16404 search results - page 294 / 3281
» A set coverage problem
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 4 months ago
Definition sets for the Direct Kinematics of Parallel Manipulators
The aim of this paper is to characterize the uniqueness domains in the workspace of parallel manipulators, as well as their image in the joint space. The notion of aspect introduc...
Philippe Wenger, Damien Chablat
JMLR
2008
133views more  JMLR 2008»
15 years 4 months ago
Algorithms for Sparse Linear Classifiers in the Massive Data Setting
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...
Suhrid Balakrishnan, David Madigan
JGAA
2006
108views more  JGAA 2006»
15 years 4 months ago
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the v...
Sergio Cabello
JMLR
2006
112views more  JMLR 2006»
15 years 4 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
GEOINFORMATICA
2002
84views more  GEOINFORMATICA 2002»
15 years 4 months ago
Simultaneous Graphic Generalization of Vector Data Sets
Manual cartographic generalization is a simultaneous process. However, most automatic approaches so far have been sequential; generalization operators are applied one at a time in...
Lars Harrie, Tapani Sarjakoski