2485 search results - page 202 / 497 » Time Bounded Frequency Computations |
153
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
176
click to vote
CONCUR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
177
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
163
click to vote
SI3D
2006
ACM
16 years 15 days ago
2006
ACM
Shadow maps are a widely used shadowing technique in real time graphics. One major drawback of their use is that they cannot be filtered in the same way as color textures, typica...
185
click to vote
RTSS
2003
IEEE
15 years 11 months ago
2003
IEEE
Often, data used in on-line decision making (for example, in determining how to react to changes in process behavior, traffic flow control, etc.) is dynamic in nature and hence ...