Sciweavers

1085 search results - page 50 / 217
» Hug over a distance
Sort
View
IWPEC
2009
Springer
14 years 4 months ago
Improved Parameterized Algorithms for the Kemeny Aggregation Problem
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
Narges Simjour
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
14 years 10 months ago
Adaptive duplicate detection using learnable string similarity measures
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Mikhail Bilenko, Raymond J. Mooney
CNSR
2009
IEEE
164views Communications» more  CNSR 2009»
14 years 1 months ago
DibA: An Adaptive Broadcasting Scheme in Mobile Ad Hoc Networks
Broadcasting is a vital communication mechanism in Mobile Ad Hoc Networks, as it is the key element for exchanging control packets to support some services such as management and ...
Dimitrios Liarokapis, Alireza Shahrabi, Andreas Ko...
VLDB
2002
ACM
126views Database» more  VLDB 2002»
13 years 9 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
SISAP
2008
IEEE
188views Data Mining» more  SISAP 2008»
14 years 4 months ago
High-Dimensional Similarity Retrieval Using Dimensional Choice
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
Dave Tahmoush, Hanan Samet