Sciweavers

2031 search results - page 86 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SIGMOD
2010
ACM
213views Database» more  SIGMOD 2010»
15 years 2 months ago
On active learning of record matching packages
We consider the problem of learning a record matching package (classifier) in an active learning setting. In active learning, the learning algorithm picks the set of examples to ...
Arvind Arasu, Michaela Götz, Raghav Kaushik
GD
2009
Springer
15 years 2 months ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
CVPR
2005
IEEE
15 years 12 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
ICPR
2006
IEEE
15 years 11 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
EPEW
2005
Springer
15 years 3 months ago
PiDuce: A Process Calculus with Native XML Datatypes
We develop the static and dynamic semantics of PiDuce, a process calculus with XML values, schemas, and pattern matching. PiDuce values include channel names, therefore the structu...
Allen L. Brown Jr., Cosimo Laneve, L. Gregory Mere...