2031 search results - page 85 / 407 » On Tree-Constrained Matchings and Generalizations |
101
click to vote
ISAAC
2007
Springer
15 years 4 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
114
click to vote
IPMI
2009
Springer
15 years 10 months ago
2009
Springer
A general-purpose deformable registration algorithm referred
to as ”DRAMMS” is presented in this paper. DRAMMS adds to the
literature of registration methods that bridge betw...
158
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
In many business scenarios, record matching is performed across different data sources with the aim of identifying common information shared among these sources. However such need...
109
click to vote
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...