Sciweavers

3 search results - page 1 / 1
» Scalable Name Disambiguation using Multi-level Graph Partiti...
Sort
View
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 6 months ago
Scalable Name Disambiguation using Multi-level Graph Partition
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
Byung-Won On, Dongwon Lee
SAC
2010
ACM
13 years 11 months ago
MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
David Portugal, Rui Rocha
CIKM
2008
Springer
13 years 6 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...