Sciweavers

45 search results - page 9 / 9
» Storage Capacity of Labeled Graphs
Sort
View
SPAA
2006
ACM
13 years 11 months ago
On space-stretch trade-offs: upper bounds
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi
CIDM
2007
IEEE
13 years 9 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
AIRWEB
2007
Springer
13 years 11 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
CIKM
2010
Springer
13 years 4 months ago
A structured approach to query recommendation with social annotation data
Query recommendation has been recognized as an important mean to help users search and also improve the usability of search engines. Existing approaches mainly focus on helping us...
Jiafeng Guo, Xueqi Cheng, Gu Xu, Huawei Shen
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 3 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang