Sciweavers

11160 search results - page 356 / 2232
» Incompleteness in a General Setting
Sort
View
189
Voted
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
15 years 11 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
CJ
1999
95views more  CJ 1999»
15 years 6 months ago
Two Kinds of Probabilistic Induction
Problems in probabilistic induction are of two general kinds. In the first, we have a linearly ordered sequence of symbols that must be extrapolated. In the second we want to extr...
Ray J. Solomonoff
SIGIR
2008
ACM
15 years 6 months ago
Personal vs non-personal blogs: initial classification experiments
We address the task of separating personal from non-personal blogs, and report on a set of baseline experiments where we compare the performance on a small set of features across ...
Erik Elgersma, Maarten de Rijke
ICSE
2008
IEEE-ACM
16 years 7 months ago
Symbolic mining of temporal specifications
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
Mark Gabel, Zhendong Su
WWW
2009
ACM
16 years 7 months ago
Exploiting web search engines to search structured databases
Web search engines often federate many user queries to relevant structured databases. For example, a product related query might be federated to a product database containing thei...
Arnd Christian König, Dong Xin, Kaushik Chakr...