5606 search results - page 701 / 1122 » Randomization Techniques for Graphs. |
173
click to vote
CICLING
2003
Springer
16 years 3 days ago
2003
Springer
Finite-state processing is typically based on structures that allow for efficient indexing and sequential search. However, this “rigid” framework has several disadvantages when...
173
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
Programmable shading is a common technique for production animation, but interactive programmable shading is not yet widely available. We support interactive programmable shading ...
163
click to vote
AMAI
2000
Springer
15 years 11 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...
176
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
- Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register les must be preserved in order for the task to be resumed. This e...
191
click to vote
PLILP
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...