Sciweavers

649 search results - page 76 / 130
» An Improved Construction of Progression-Free Sets
Sort
View
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 9 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
SIGIR
2003
ACM
15 years 11 months ago
Building a web thesaurus from web link structure
Thesaurus has been widely used in many applications, including information retrieval, natural language processing, and question answering. In this paper, we propose a novel approa...
Zheng Chen, Shengping Liu, Liu Wenyin, Geguang Pu,...
ILP
2007
Springer
16 years 9 days ago
ILP : - Just Trie It
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
LICS
2003
IEEE
15 years 11 months ago
Labelled Markov Processes: Stronger and Faster Approximations
This paper reports on and discusses three notions of approximation for Labelled Markov Processes that have been developed last year. The three schemes are improvements over former...
Vincent Danos, Josee Desharnais
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 6 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin