Sciweavers

1413 search results - page 177 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 12 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
ACL
2009
15 years 2 months ago
Concise Integer Linear Programming Formulations for Dependency Parsing
We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...
André L. Martins, Noah A. Smith, Eric P. Xi...
COGSCI
2010
125views more  COGSCI 2010»
15 years 4 months ago
A Probabilistic Computational Model of Cross-Situational Word Learning
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
Afsaneh Fazly, Afra Alishahi, Suzanne Stevenson
PVLDB
2010
128views more  PVLDB 2010»
14 years 11 months ago
Searching Workflows with Hierarchical Views
Workflows are prevalent in diverse applications, which can be scientific experiments, business processes, web services, or recipes. With the dramatically growing number of workflo...
Ziyang Liu, Qihong Shao, Yi Chen
CORR
2002
Springer
180views Education» more  CORR 2002»
15 years 4 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer