Sciweavers

1439 search results - page 214 / 288
» Fast approximation of centrality
Sort
View
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
14 years 11 months ago
Group Linkage
Poor quality data is prevalent in databases due to a variety of reasons, including transcription errors, lack of standards for recording database fields, etc. To be able to query ...
Byung-Won On, Nick Koudas, Dongwon Lee, Divesh Sri...
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient methods for topic model inference on streaming document collections
Topic models provide a powerful tool for analyzing large text collections by representing high dimensional data in a low dimensional subspace. Fitting a topic model given a set of...
Limin Yao, David M. Mimno, Andrew McCallum
INFOCOM
2002
IEEE
14 years 2 months ago
Restoration Algorithms for Virtual Private Networks in the Hose Model
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
Giuseppe F. Italiano, Rajeev Rastogi, Bülent ...
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
14 years 2 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...