Sciweavers

4137 search results - page 287 / 828
» On the number of matchings of a tree
Sort
View
TKDE
2011
363views more  TKDE 2011»
15 years 1 months ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
CVPR
2012
IEEE
13 years 9 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
WWW
2009
ACM
16 years 7 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
BMCBI
2010
176views more  BMCBI 2010»
15 years 6 months ago
TargetSpy: a supervised machine learning approach for microRNA target prediction
Background: Virtually all currently available microRNA target site prediction algorithms require the presence of a (conserved) seed match to the 5' end of the microRNA. Recen...
Martin Sturm, Michael Hackenberg, David Langenberg...
POPL
2010
ACM
16 years 4 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno