Sciweavers

1807 search results - page 293 / 362
» Backdoors in the Context of Learning
Sort
View
WWW
2006
ACM
14 years 9 months ago
A web-based kernel function for measuring the similarity of short text snippets
Determining the similarity of short text snippets, such as search queries, works poorly with traditional document similarity measures (e.g., cosine), since there are often few, if...
Mehran Sahami, Timothy D. Heilman
WWW
2005
ACM
14 years 9 months ago
Adaptive query routing in peer web search
An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engin...
Le-Shin Wu, Ruj Akavipat, Filippo Menczer
CHI
2009
ACM
14 years 9 months ago
Enhancing input device evaluation: longitudinal approaches
Jens Gerken HCI Group, University of Konstanz Box D-73 78457 Konstanz, Germany jens.gerken@uni-konstanz.de Hans-Joachim Bieg HCI Group, University of Konstanz Box D-73 78457 Konsta...
Jens Gerken, Hans-Joachim Bieg, Stefan Dierdorf, H...
CHI
2009
ACM
14 years 9 months ago
Using language tests and emotional expressions to determine the learnability of artificial languages
The study described hereunder lies within the context of a larger project focusing on the design and implementation of a "Robotic Interaction Language". The research goa...
Omar Mubin, Suleman Shahid, Christoph Bartneck, Em...
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 9 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan