Sciweavers

4451 search results - page 294 / 891
» On Random Ordering Constraints
Sort
View
EDBT
2010
ACM
132views Database» more  EDBT 2010»
15 years 10 months ago
Turbo-charging hidden database samplers with overflowing queries and skew reduction
Recently, there has been growing interest in random sampling from online hidden databases. These databases reside behind form-like web interfaces which allow users to execute sear...
Arjun Dasgupta, Nan Zhang 0004, Gautam Das
JCNS
2002
101views more  JCNS 2002»
15 years 6 months ago
Redundancy and Synergy Arising from Pairwise Correlations in Neuronal Ensembles
Multielectrode arrays allow recording of the activity of many single neurons, from which correlations can be calculated. The functional roles of correlations can be revealed by mea...
Michele Bezzi, Mathew E. Diamond, Alessandro Treve...
SIAMCOMP
2002
112views more  SIAMCOMP 2002»
15 years 6 months ago
The Efficiency of Resolution and Davis--Putnam Procedures
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...
MA
2010
Springer
140views Communications» more  MA 2010»
15 years 5 months ago
The Dirichlet Markov Ensemble
We equip the polytope of n × n Markov matrices with the normalized trace of the Lebesgue measure of Rn2 . This probability space provides random Markov matrices, with i.i.d. rows...
Djalil Chafaï
ECCC
2010
122views more  ECCC 2010»
15 years 5 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah