Sciweavers

568 search results - page 36 / 114
» New bounds for the Cebysev functional
Sort
View
TRANSCI
2008
94views more  TRANSCI 2008»
13 years 6 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...
FOCS
1990
IEEE
13 years 11 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
SYNASC
2006
IEEE
121views Algorithms» more  SYNASC 2006»
14 years 1 months ago
Color Texture Modeling and Color Image Decomposition in a Variational-PDE Approach
This paper is devoted to a new variational model for color texture modeling and color image decomposition into cartoon and texture. A given image f in the RGB space is decomposed ...
Luminita A. Vese, Stanley Osher
JACM
2006
146views more  JACM 2006»
13 years 7 months ago
Limits on the ability of quantum states to convey classical messages
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of...
Ashwin Nayak, Julia Salzman
FOCS
2003
IEEE
14 years 27 days ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev