Sciweavers

1188 search results - page 214 / 238
» Extended Graph Unification
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 9 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
14 years 3 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
IUI
2009
ACM
14 years 3 months ago
Discovering frequent work procedures from resource connections
Intelligent desktop assistants could provide more help for users if they could learn models of the users’ workflows. However, discovering desktop workflows is difficult becau...
Jianqiang Shen, Erin Fitzhenry, Thomas G. Dietteri...
WSDM
2009
ACM
114views Data Mining» more  WSDM 2009»
14 years 3 months ago
Wikipedia pages as entry points for book search
A lot of the world’s knowledge is stored in books, which, as a result of recent mass-digitisation efforts, are increasingly available online. Search engines, such as Google Book...
Marijn Koolen, Gabriella Kazai, Nick Craswell
BIBE
2006
IEEE
154views Bioinformatics» more  BIBE 2006»
14 years 2 months ago
Determining Molecular Similarity for Drug Discovery using the Wavelet Riemannian Metric
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
Elinor Velasquez, Emmanuel R. Yera, Rahul Singh