Sciweavers

4199 search results - page 441 / 840
» Generalizing Data in Natural Language
Sort
View
CIKM
2010
Springer
15 years 5 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
ECAI
2006
Springer
15 years 10 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 7 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
202
Voted
PEPM
1992
ACM
15 years 10 months ago
Self-applicable C Program Specialization
A partial evaluator is an automatic program transformation tool. Given as input a general program and part of its input, it can produce a specialized version. If the partial evalu...
Lars Ole Andersen
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 6 months ago
Ownership Confinement Ensures Representation Independence for Object-Oriented Programs
for data abstraction and justifies reasoning by simulation. Representation independence has been shown for a variety of languages and constructs but not for shared references to mu...
Anindya Banerjee, David A. Naumann