Sciweavers

1314 search results - page 173 / 263
» Approximate data mining in very large relational data
Sort
View
CVPR
2010
IEEE
16 years 25 days ago
Semi-supervised Hashing for Scalable Image Retrieval
Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several hashing methods have been proposed to allow approx...
Jun Wang, Sanjiv Kumar, Shih-Fu Chang
TOCHI
2010
90views more  TOCHI 2010»
15 years 2 months ago
Potential for personalization
Current Web search tools do a good job of retrieving documents that satisfy the wide range of intentions that people associate with a query – but do not do a very good job of di...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 4 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 8 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo
239
Voted
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 5 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...