Sciweavers

9507 search results - page 1676 / 1902
» Time-based language models
Sort
View
KBSE
2010
IEEE
15 years 3 months ago
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
Pieter Hooimeijer, Westley Weimer
TAL
2010
Springer
15 years 3 months ago
Concept Based Representations for Ranking in Geographic Information Retrieval
Abstract. Geographic Information Retrieval (GIR) is a specialized Information Retrieval (IR) branch that deals with information related to geographical locations. Traditional IR en...
Maya Carrillo, Esaú Villatoro-Tello, Aureli...
188
Voted
EMNLP
2010
15 years 3 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
GI
2009
Springer
15 years 2 months ago
A BPMN Case Study: Paper Review and Submission System
: We explore the expressiveness of the BPMN workflow modelling language by applying it to MuCoMS, a paper submission system. This well known application domain is a suitable exampl...
Markus Kirchberg, Ove Sörensen, Bernhard Thal...
WWW
2011
ACM
15 years 1 days ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
« Prev « First page 1676 / 1902 Last » Next »