Sciweavers

139 search results - page 4 / 28
» Reducibilities Relating to Schnorr Randomness
Sort
View
EDBT
2010
ACM
135views Database» more  EDBT 2010»
14 years 2 months ago
Probabilistic ranking over relations
Probabilistic top-k ranking queries have been extensively studied due to the fact that data obtained can be uncertain in many real applications. A probabilistic top-k ranking quer...
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin
ICDE
2006
IEEE
428views Database» more  ICDE 2006»
15 years 3 days ago
Integrating Unstructured Data into Relational Databases
In this paper we present a system for automatically integrating unstructured text into a multi-relational database using state-of-the-art statistical models for structure extracti...
Imran R. Mansuri, Sunita Sarawagi
ISCAS
2006
IEEE
90views Hardware» more  ISCAS 2006»
14 years 4 months ago
Phase measurement and adjustment of digital signals using random sampling technique
—This paper introduces a technique to measure and adjust the relative phase of on-chip high speed digital signals using a random sampling technique of inferential statistics. The...
Rashed Zafar Bhatti, Monty Denneau, Jeff Draper
FSTTCS
1992
Springer
14 years 2 months ago
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...
Vikraman Arvind, Johannes Köbler, Martin Mund...
APAL
2010
125views more  APAL 2010»
13 years 11 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day