16404 search results - page 741 / 3281 » A set coverage problem |
184
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
175
click to vote
LATIN
2010
Springer
16 years 2 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
199
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
207
click to vote
ICDM
2006
IEEE
16 years 1 months ago
2006
IEEE
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
225
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...