Sciweavers

2031 search results - page 56 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
CPM
2007
Springer
94views Combinatorics» more  CPM 2007»
16 years 4 days ago
Finding Witnesses by Peeling
In the k-matches problem, we are given a pattern and a text, and for each text location, the desired output consists of all aligned matching characters if there are k or fewer of ...
Yonatan Aumann, Moshe Lewenstein, Noa Lewenstein, ...
154
Voted
AAAI
2006
15 years 7 months ago
Unsupervised Order-Preserving Regression Kernel for Sequence Analysis
In this work, a generalized method for learning from sequence of unlabelled data points based on unsupervised order-preserving regression is proposed. Sequence learning is a funda...
Young-In Shin
CVPR
2011
IEEE
15 years 1 months ago
Intrinsic Dense 3D Surface Tracking
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
Yun Zeng, Chaohui Wang, Yang Wang, David Gu, Dimit...
JAL
2006
101views more  JAL 2006»
15 years 6 months ago
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
Nicholas J. A. Harvey, Richard E. Ladner, Lá...
KR
2004
Springer
15 years 11 months ago
Qualitative Probabilistic Matching with Hierarchical Descriptions
This paper is about decision making based on real-world descriptions of a domain. There are many domains where differentpeoplehavedescribedvariouspartsoftheworldatdifferent f abst...
Clinton Smyth, David Poole