Sciweavers

2925 search results - page 58 / 585
» Information Complexity of Online Problems
Sort
View
WWW
2002
ACM
16 years 6 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
MKWI
2008
190views Business» more  MKWI 2008»
15 years 7 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
BCSHCI
2007
15 years 7 months ago
"The devil you know knows best": how online recommendations can benefit from social networking
The defining characteristic of the Internet today is an abundance of information and choice. Recommender Systems (RS), designed to alleviate this problem, have so far not been ver...
Philip Bonhard, Martina Angela Sasse, Clare Harrie...
CIKM
2009
Springer
15 years 10 months ago
Probabilistic models for topic learning from images and captions in online biomedical literatures
Biomedical images and captions are one of the major sources of information in online biomedical publications. They often contain the most important results to be reported, and pro...
Xin Chen, Caimei Lu, Yuan An, Palakorn Achananupar...
DATAMINE
2007
110views more  DATAMINE 2007»
15 years 6 months ago
The complexity of non-hierarchical clustering with instance and cluster level constraints
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...
Ian Davidson, S. S. Ravi