Sciweavers

1399 search results - page 175 / 280
» New Algorithms for k-Center and Extensions
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Recognizing Exponential Inter-Contact Time in VANETs
—Inter-contact time between moving vehicles is one of the key metrics in vehicular ad hoc networks (VANETs) and central to forwarding algorithms and the end-to-end delay. Due to ...
Hongzi Zhu, Luoyi Fu, Guangtao Xue, Yanmin Zhu, Mi...
IWPC
2010
IEEE
13 years 7 months ago
Using Data Fusion and Web Mining to Support Feature Location in Software
—Data fusion is the process of integrating multiple sources of information such that their combination yields better results than if the data sources are used individually. This ...
Meghan Revelle, Bogdan Dit, Denys Poshyvanyk
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
14 years 9 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
BMCBI
2010
106views more  BMCBI 2010»
13 years 9 months ago
A novel approach for haplotype-based association analysis using family data
Background: Haplotype-based approaches have been extensively studied for case-control association mapping in recent years. It has been shown that haplotype methods can provide mor...
Yixuan Chen, Xin Li, Jing Li
SIGMOD
2010
ACM
262views Database» more  SIGMOD 2010»
14 years 1 months ago
K-nearest neighbor search for fuzzy objects
The K-Nearest Neighbor search (kNN) problem has been investigated extensively in the past due to its broad range of applications. In this paper we study this problem in the contex...
Kai Zheng, Gabriel Pui Cheong Fung, Xiaofang Zhou