Sciweavers

264 search results - page 38 / 53
» Learning Linearly Separable Languages
Sort
View
NIPS
2004
15 years 3 months ago
The Power of Selective Memory: Self-Bounded Learning of Prediction Suffix Trees
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
Ofer Dekel, Shai Shalev-Shwartz, Yoram Singer
130
Voted
CIKM
2010
Springer
15 years 1 months ago
Clickthrough-based translation models for web search: from word models to phrase models
Web search is challenging partly due to the fact that search queries and Web documents use different language styles and vocabularies. This paper provides a quantitative analysis ...
Jianfeng Gao, Xiaodong He, Jian-Yun Nie
97
Voted
CP
2007
Springer
15 years 8 months ago
Hierarchical Hardness Models for SAT
Abstract. Empirical hardness models are a recent approach for studying NP-hard problems. They predict the runtime of an instance using efficiently computable features. Previous res...
Lin Xu, Holger H. Hoos, Kevin Leyton-Brown
ECOOP
1999
Springer
15 years 6 months ago
Propagating Class and Method Combination
Abstract. This paper presents a mixin based class and method combination mechanism with block structure propagation. Traditionally, mixins can be composed to form new classes, poss...
Erik Ernst
123
Voted
CVPR
2006
IEEE
16 years 4 months ago
Shape-Based Approach to Robust Image Segmentation using Kernel PCA
Segmentation involves separating an object from the background. In this work, we propose a novel segmentation method combining image information with prior shape knowledge, within...
Samuel Dambreville, Yogesh Rathi, Allen Tannenbaum