Sciweavers

79 search results - page 2 / 16
» Piercing random boxes
Sort
View
FSTTCS
2009
Springer
13 years 12 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
IMSCCS
2006
IEEE
13 years 11 months ago
Frequency Distribution of TATA Box and Extension Sequences on Human Promoters
Background: TATA box is one of the most important transcription factor binding sites. But the exact sequences of TATA box are still not very clear. Results: In this study, we cond...
Wei Shi, Wanlei Zhou
CAV
2008
Springer
125views Hardware» more  CAV 2008»
13 years 7 months ago
Application of Formal Word-Level Analysis to Constrained Random Simulation
Abstract. Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain s...
Hyondeuk Kim, HoonSang Jin, Kavita Ravi, Petr Spac...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 5 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
ICML
2004
IEEE
14 years 6 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...