Sciweavers

3652 search results - page 584 / 731
» A study of query length
Sort
View
JUCS
2010
115views more  JUCS 2010»
14 years 11 months ago
Redundant Relations in Relational Databases: A Model Theoretic Perspective
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
Flavio Antonio Ferrarotti, Alejandra Lorena Paolet...

Publication
344views
14 years 2 months ago
Top-k Similarity Join over Multi-valued Objects
The top-k similarity joins have been extensively studied and used in a wide spectrum of applications such as information retrieval, decision making, spatial data analysis and dat...
Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuem...
SDM
2012
SIAM
282views Data Mining» more  SDM 2012»
13 years 7 months ago
Citation Prediction in Heterogeneous Bibliographic Networks
To reveal information hiding in link space of bibliographical networks, link analysis has been studied from different perspectives in recent years. In this paper, we address a no...
Xiao Yu, Quanquan Gu, Mianwei Zhou, Jiawei Han
WWW
2006
ACM
16 years 5 months ago
Automatic identification of user interest for personalized search
One hundred users, one hundred needs. As more and more topics are being discussed on the web and our vocabulary remains relatively stable, it is increasingly difficult to let the ...
Feng Qiu, Junghoo Cho
STOC
2005
ACM
96views Algorithms» more  STOC 2005»
16 years 5 months ago
Every monotone graph property is testable
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
Noga Alon, Asaf Shapira