2252 search results - page 205 / 451 » Lower Bounds for Dynamic Algorithms |
109
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
148
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
123
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
A vector-sensor consisting of a monopole sensor collocated with orthogonally oriented dipole sensors can be used for direction-ofarrival (DOA) estimation. A method is proposed to ...
117
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
106
Voted
AAAI
2010
15 years 5 months ago
2010
Trial-based approaches offer an efficient way to solve singleagent MDPs and POMDPs. These approaches allow agents to focus their computations on regions of the environment they en...