Sciweavers

3415 search results - page 283 / 683
» Lower bounds on kernelization
Sort
View
ORL
2008
88views more  ORL 2008»
15 years 6 months ago
Approximating integrals of multivariate exponentials: A moment approach
We propose a method to calculate lower and upper bounds of some exponential multivariate integrals using moment relaxations and show that they asymptotically converge to the value...
Dimitris Bertsimas, Xuan Vinh Doan, Jean B. Lasser...
178
Voted
JALC
2007
84views more  JALC 2007»
15 years 6 months ago
Enumeration of Context-Free Languages and Related Structures
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
Michael Domaratzki, Alexander Okhotin, Jeffrey Sha...
TOC
2008
75views more  TOC 2008»
15 years 6 months ago
A Quantum Algorithm for the Hamiltonian NAND Tree
Abstract: We give a quantum algorithm for the binary NAND tree problem in the Hamiltonian oracle model. The algorithm uses a continuous time quantum walk with a running time propor...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann
DM
2000
76views more  DM 2000»
15 years 6 months ago
On the number of ordered factorizations of natural numbers
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
Benny Chor, Paul Lemke, Ziv Mador
JCS
2000
148views more  JCS 2000»
15 years 6 months ago
Using Sample Size to Limit Exposure to Data Mining
Data mining introduces new problems in database security. The basic problem of using non-sensitive data to infer sensitive data is made more difficult by the "prob abilistic&...
Chris Clifton