1538 search results - page 206 / 308 » Spectral Techniques in Graph Algorithms |
192
click to vote
CC
2009
Springer
16 years 2 months ago
2009
Springer
Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts spill code to move the values of variables b...
103
click to vote
ICRA
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
112
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
116
click to vote
WG
2010
Springer
14 years 12 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
ICCAD
1997
IEEE
15 years 5 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...