276 search results - page 42 / 56 » The Complexity of Computing Maximal Word Functions |
94
Voted
VISUALIZATION
1999
IEEE
15 years 4 months ago
1999
IEEE
We present a technique for optimizing the rendering of highdepth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set fo...
120
click to vote
AAAI
2010
15 years 1 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
Due to the increasing performance requirements of decoding H.264/AVC in HDTV or larger resolutions, new approaches are necessary to enable real-time processing. According to the cu...
TCS
2008
14 years 11 months ago
2008
The replication number of a branching program is the minimum number R such that along every accepting computation at most R variables are tested more than once; the sets of variab...
118
Voted
STACS
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...