Sciweavers

614 search results - page 30 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
MP
2006
88views more  MP 2006»
13 years 7 months ago
Bounds on linear PDEs via semidefinite optimization
Using recent progress on moment problems, and their connections with semidefinite optimization, we present in this paper a new methodology based on semidefinite optimization, to ob...
Dimitris Bertsimas, Constantine Caramanis
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
13 years 7 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
AI
2005
Springer
13 years 7 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
ISIPTA
2003
IEEE
130views Mathematics» more  ISIPTA 2003»
14 years 21 days ago
Some Results on Generalized Coherence of Conditional Probability Bounds
Based on the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), we adopt a probabilistic approach to uncertainty based on conditional p...
Veronica Biazzo, Angelo Gilio, Giuseppe Sanfilippo
COMPGEOM
2010
ACM
14 years 15 days ago
Lines avoiding balls in three dimensions revisited
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...
Natan Rubin