Sciweavers

1778 search results - page 313 / 356
» The Theory of Probabilistic Databases
Sort
View
POPL
2004
ACM
16 years 4 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
144
Voted
WWW
2010
ACM
15 years 11 months ago
Find me if you can: improving geographical prediction with social and spatial proximity
Geography and social relationships are inextricably intertwined; the people we interact with on a daily basis almost always live near us. As people spend more time online, data re...
Lars Backstrom, Eric Sun, Cameron Marlow
160
Voted
SAC
2010
ACM
15 years 10 months ago
Inductive reasoning and semantic web search
Extensive research activities are recently directed towards the Semantic Web as a future form of the Web. Consequently, Web search as the key technology of the Web is evolving tow...
Claudia d'Amato, Floriana Esposito, Nicola Fanizzi...
CIKM
2009
Springer
15 years 10 months ago
A query model based on normalized log-likelihood
Leveraging information from relevance assessments has been proposed as an effective means for improving retrieval. We introduce a novel language modeling method which uses inform...
Edgar Meij, Wouter Weerkamp, Maarten de Rijke
116
Voted
CIKM
2009
Springer
15 years 10 months ago
Predicting the volume of comments on online news stories
On-line news agents provide commenting facilities for readers to express their views with regard to news stories. The number of user supplied comments on a news article may be ind...
Manos Tsagkias, Wouter Weerkamp, Maarten de Rijke