337 search results - page 22 / 68 » Computational complexity of weighted splitting schemes on pa... |
EGH
2009
Springer
13 years 5 months ago
2009
Springer
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends th...
ICDCS
2009
IEEE
14 years 5 months ago
2009
IEEE
—Content-based service, which dynamically routes and delivers events from sources to interested users, is extremely important to network services. However, existing content-based...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
FPL
2010
Springer
13 years 5 months ago
2010
Springer
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...