451 search results - page 15 / 91 » Some Lower Bounds on Geometric Separability Problems |
IJON
2007
14 years 9 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
ADC
2008
Springer
15 years 4 months ago
2008
Springer
With respect to current methods for query evaluation over XML data streams, adoption of certain types of buffering techniques is unavoidable. Under lots of circumstances, the buff...
74
Voted
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...