Sciweavers

2031 search results - page 304 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
15 years 10 months ago
Febrl -: an open source data cleaning, deduplication and record linkage system with a graphical user interface
Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs ...
Peter Christen
ICALP
2009
Springer
15 years 10 months ago
Algorithms for Secretary Problems on Graphs and Hypergraphs
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
Martin Pál, Nitish Korula
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
15 years 10 months ago
An efficient and accurate method for evaluating time series similarity
A variety of techniques currently exist for measuring the similarity between time series datasets. Of these techniques, the methods whose matching criteria is bounded by a specifi...
Michael D. Morse, Jignesh M. Patel
EUROSYS
2006
ACM
15 years 7 months ago
Ferret: a toolkit for content-based similarity search of feature-rich data
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...
Qin Lv, William Josephson, Zhe Wang, Moses Charika...
FPGA
2010
ACM
359views FPGA» more  FPGA 2010»
15 years 6 months ago
Towards scalable placement for FPGAs
Placement based on simulated annealing is in dominant use in the FPGA community due to its superior quality of result (QoR). However, given the progression of FPGA device capacity...
Huimin Bian, Andrew C. Ling, Alexander Choong, Jia...