3604 search results - page 100 / 721 » All Common Subsequences |
51
Voted
IPL
2006
14 years 12 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
JMLR
2006
14 years 12 months ago
2006
Abstract. We give dimension-free and data-dependent bounds for linear multi-task learning where a common linear operator is chosen to preprocess data for a vector of task speci...c...
115
click to vote
DM
2002
14 years 11 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
TITB
2010
14 years 6 months ago
2010
This contribution investigates the feasibility of the passive UHF RF identification technology for the wireless monitoring of human body movements in some common sleep disorders by...
CSFW
2007
IEEE
15 years 6 months ago
2007
IEEE
Collaboration among organizations or individuals is common. While these participants are often unwilling to share all their information with each other, some information sharing i...