Sciweavers

243 search results - page 19 / 49
» Interactive Search Refinement Techniques for HARD Tasks
Sort
View
UIST
2006
ACM
14 years 2 months ago
Viz: a visual analysis suite for explaining local search behavior
NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algori...
Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
BMCBI
2005
122views more  BMCBI 2005»
13 years 8 months ago
A neural strategy for the inference of SH3 domain-peptide interaction specificity
Background: The SH3 domain family is one of the most representative and widely studied cases of so-called Peptide Recognition Modules (PRM). The polyproline II motif PxxP that gen...
Enrico Ferraro, Allegra Via, Gabriele Ausiello, Ma...
INFOVIS
2003
IEEE
14 years 2 months ago
EdgeLens: An Interactive Method for Managing Edge Congestion in Graphs
An increasing number of tasks require people to explore, navigate and search extremely complex data sets visualized as graphs. Examples include electrical and telecommunication ne...
Nelson Wong, M. Sheelagh T. Carpendale, Saul Green...
CIKM
2009
Springer
13 years 9 months ago
Improving search engines using human computation games
Work on evaluating and improving the relevance of web search engines typically use human relevance judgments or clickthrough data. Both these methods look at the problem of learni...
Hao Ma, Raman Chandrasekar, Chris Quirk, Abhishek ...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 7 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